摘要：Dashboard - Educational Codeforces Round 166 Problem - A - Codeforces 签到(写的有点烦...) #include<bits/stdc++.h> using namespace std; const int N=2e5+10; vo
阅读全文
|
|
合集-codeforces edu
摘要：Dashboard - Educational Codeforces Round 166 Problem - A - Codeforces 签到(写的有点烦...) #include<bits/stdc++.h> using namespace std; const int N=2e5+10; vo
阅读全文
摘要：Educational Codeforces Round 171 (Rated for Div. 2) - Codeforces Problem - A - Codeforces 几何 构造 没什么好说的，\(45\)度交的时候长度最大 #include<bits/stdc++.h> using n
阅读全文
摘要：Educational Codeforces Round 169 (Rated for Div. 2) - Codeforces Problem - A - Codeforces 构造 签到题，明显只有\(n\leq2\)的时候有解 #include<bits/stdc++.h> using nam
阅读全文
摘要：Educational Codeforces Round 80 (Rated for Div. 2) - Codeforces Problem - A - Codeforces 数学 双钩函数，直接显然极值点是\(\sqrt{d}-1\),但要注意取整的时候可能存在偏差，暴力搜索一下附近的值就好了
阅读全文
摘要：Educational Codeforces Round 172 (Rated for Div. 2) - Codeforces Problem - A - Codeforces 数学 排序 显然将数组排序之后每次拿最大值，若恰好拿到\(k\)则答案为\(0\),如果中途拿到\(i\)时总和，大于\
阅读全文
摘要：Educational Codeforces Round 157 (Rated for Div. 2) Problem - A - Codeforces 构造 签到题没啥好说的 #include<bits/stdc++.h> using namespace std; const int N=2e5+
阅读全文
摘要：Educational Codeforces Round 173 (Rated for Div. 2) - Codeforces Problem - A - Codeforces 签到题目 Problem - B - Codeforces 数学 被小学奥数薄纱力.... 给出一个由\(n!\)个\(
阅读全文
摘要：Educational Codeforces Round 165 Problem - A - Codeforces 答案只会是2或3，分类一下就好了 #include<bits/stdc++.h> using namespace std; const int N=2e5+10; int n; int
阅读全文
|
