![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
题解
CHD MB队题解博客
这个作者很懒,什么都没留下…
展开
-
小米邀请赛第一场网络赛题解C,J,I
其实这一题挺简单的,打的时候想多了;就是找块,注意特判一下全部都是的W,我也不知道别人特判了没有,可能我写的比较cj吧。#include<bits/stdc++.h>using namespace std;const int maxn=1e5+3;#define ll long longint a[maxn];int main(){ ios::sync_with_stdio(false); string s; cin>>s; int s.原创 2020-10-25 21:03:47 · 328 阅读 · 0 评论 -
CodeForces - 977A-B-C-D-E-F
Codefoces 977A - Wrong Subtraction CodeForces - 977ALittle girl Tanya is learning how to decrease a number by one, but she does it wrong with a number consisting of two or more digits. Tanya subtracts one from a number by the following algorithm:if the原创 2020-09-11 08:29:59 · 497 阅读 · 0 评论 -
CodeForces 1015A-B-C-D-E-F
Codefoces 1015A - Points in Segments CodeForces - 1015AYou are given a set of n segments on the axis Ox, each segment has integer endpoints between 1 and m inclusive. Segments may intersect, overlap or even coincide with each other. Each segment is chara原创 2020-09-09 18:16:03 · 420 阅读 · 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 · 144 阅读 · 0 评论 -
Codefoces 1133ABCDE部分题解
Codefoces 1343 A-D题解1343 A - CandiesRecently 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 · 401 阅读 · 0 评论