训练感悟
CHD MB队题解博客
这个作者很懒,什么都没留下…
展开
-
小米邀请赛第一场网络赛题解C,J,I
其实这一题挺简单的,打的时候想多了;就是找块,注意特判一下全部都是的W,我也不知道别人特判了没有,可能我写的比较cj吧。 #include<bits/stdc++.h> using namespace std; const int maxn=1e5+3; #define ll long long int a[maxn]; int main() { ios::sync_with_stdio(false); string s; cin>>s; int s.原创 2020-10-25 21:03:47 · 321 阅读 · 0 评论 -
Codeforces Round #636 (Div. 3)部分题解
链接:Codeforces Round #636 (Div. 3) A - Candies 题意:求出一个x满足x+2∗x+4∗x+⋯+2k−1∗x=n且k>1 思路:提出x得x∗(1+2+4+⋯+2k−1)=n,从小到大枚举k,直到满足n∣(1+2+4+⋯+2k−1) #include <iostream> #include <algorithm> #include <cstring> #include <cstdio> using namespac原创 2020-09-05 08:04:04 · 142 阅读 · 0 评论 -
Codefoces 1133ABCDE部分题解
Codefoces 1343 A-D题解 1343 A - Candies Recently Vova found n candy wrappers. He remembers that he bought x candies during the first day, 2x candies during the second day, 4x candies during the third day, …, 2k−1x candies during the k-th day. But there is a原创 2020-09-04 11:11:12 · 381 阅读 · 0 评论