![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
CodeForces
奕申
acmer菜狗一个,冲冲冲!
展开
-
Codeforces Round #642 (Div. 3)(A,B,C,D,E,F)
Codeforces Round #642 Div. 3A. Most Unstable ArrayB. Two Arrays And SwapsC. Board MovesD. Constructing the ArrayE. K-periodic GarlandF. Decreasing Heights A. Most Unstable Array 思路: 分情况讨论 代码: #include <bits/stdc++.h> using namespace std; #define pb p原创 2020-05-15 11:29:32 · 243 阅读 · 0 评论 -
Codeforces Round #641 (Div. 2)(A,B,C,D,E)
Codeforces Round #641 Div. 2A. Orac and FactorsB. Orac and ModelsC. Orac and LCMD. Orac and MediansE. Orac and Game of Life 比赛的时候才开出两题T~T,赛后想想,被C题的数论唬到了,第一时间自己认为自己做不了数论题,其实完全不难。 A. Orac and Factors 思路: 就是找出这个数的最小的因子,加一次,然后剩下的k−1k-1k−1次都是加2, (这里我用的质数筛法求出的每个原创 2020-05-13 13:13:16 · 233 阅读 · 0 评论 -
Codeforces Round #640 (Div. 4) (A,B,C,D,E,F,G)
Codeforces Round #640 Div. 4A. Sum of Round NumbersB. Same Parity SummandsC. K-th Not Divisible by nD. Alice, Bob and CandiesE. Special Elements解法1解法2F. Binary String ReconstructionG. Special Permutation A. Sum of Round Numbers 思路: 应该都会做吧,倒序求出每一位,再成对应的权重 代原创 2020-05-11 09:51:24 · 316 阅读 · 0 评论 -
Codeforces Round #639 (Div. 2)(A,B,C,D,E)
@[TOC](Codeforces Round #639 (Div. 2)) A. Puzzle Pieces 思路: 规律题, 横列有一个值为1,另一个是多少都是合法的 行列的最小值为2的时候,行列的最大值必须也等于2才行, 其他情况都是非法的 代码: #include <bits/stdc++.h> using namespace std; #define pb push_ba...原创 2020-05-08 14:40:49 · 880 阅读 · 0 评论 -
Educational Codeforces Round 86 (Rated for Div. 2(A,B,C)
Educational Codeforces Round 86 (Rated for Div. 2A. Road To ZeroB. Binary PeriodC. Yet Another Counting Problem A. Road To Zero 思路: 贪心,可以肯定的是,先把两个降到一样大所花费的代价使max(a,b)−min(a,b)max(a,b)-min(a,b)max(a,b)...原创 2020-04-27 23:02:30 · 165 阅读 · 0 评论