随笔分类 -  Codeforces

摘要：链接：Codeforces Round #698 (Div. 2) A - Nezzar and Colorful Balls 思路：答案就是出现次数最多的数出现的次数 #include <iostream> #include <algorithm> #include <cstring> #incl 阅读全文

摘要：Codeforces Round #693 (Div. 3) A - Cards for Friends #include <iostream> #include <algorithm> #include <cstring> #include <cstdio> #include <vector> u 阅读全文

摘要：链接：Codeforces Round #636 (Div. 3) A - Candies 题意：求出一个x满足$x + 2*x + 4*x + \dots + 2^{k-1}*x = n$且$k>1$ 思路：提出x得$x*(1+2+4+\dots + 2^{k-1})=n$，从小到大枚举k，直到满 阅读全文