亦申的博客

Codeforces Round #642 Div. 3A. Most Unstable ArrayB. Two Arrays And SwapsC. Board MovesD. Constructing the ArrayE. K-periodic GarlandF. Decreasing HeightsA. Most Unstable Array思路:分情况讨论代码：#include <bits/stdc++.h>using namespace std;#define pb p

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，(这里我用的质数筛法求出的每个

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 PermutationA. Sum of Round Numbers思路：应该都会做吧，倒序求出每一位，再成对应的权重代

@[TOC](Codeforces Round #639 (Div. 2))A. Puzzle Pieces思路：规律题，横列有一个值为1，另一个是多少都是合法的行列的最小值为2的时候，行列的最大值必须也等于2才行，其他情况都是非法的代码：#include <bits/stdc++.h>using namespace std;#define pb push_ba...

Educational Codeforces Round 86 (Rated for Div. 2A. Road To ZeroB. Binary PeriodC. Yet Another Counting ProblemA. Road To Zero思路：贪心，可以肯定的是，先把两个降到一样大所花费的代价使max(a,b)−min(a,b)max(a,b)-min(a,b)max(a,b)...