- 博客(6)
- 收藏
- 关注
RSS订阅原创 小米邀请赛第一场网络赛题解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
320
原创 CodeForces - 977A-B-C-D-E-F
Codefoces 977 A - Wrong Subtraction CodeForces - 977A Little 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
473
原创 CodeForces 1015A-B-C-D-E-F
Codefoces 1015 A - Points in Segments CodeForces - 1015A You 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
405
原创 Codeforces Round #667 (Div. 3) A~D
链接: Codeforces Round #667 (Div. 3). CF 1409 A~C A - Yet Another Two Integers Problem You are given two integers ???? and ????.In one move, you can choose some integer ???? from 1 to 10 and add it to ???? or subtract it from ????. In other words, you choos
2020-09-08 13:43:21
240
原创 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
原创 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
379
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人