
Codeforces
附魔兔子
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
Codeforces Round #484 (Div. 2) Codeforces982A. Row【水】
A. Rowtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou're given a row with nn chairs. We call a seating of people "maximal" if the two following...原创 2018-07-08 09:07:00 · 252 阅读 · 0 评论 -
Codeforces Round #484 (Div. 2) Codeforces982B. Bus of Characters【栈】
B. Bus of Characterstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the Bus of Characters there are nn rows of seat, each having 22 seats. The ...原创 2018-07-08 09:19:44 · 214 阅读 · 0 评论 -
Codeforces Round #473 (Div. 2) Codeforces959C. Mahmoud and Ehab and the wrong algorithm【构造】
C. Mahmoud and Ehab and the wrong algorithmtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMahmoud was trying to solve the vertex cover problem on...原创 2018-07-08 09:53:33 · 303 阅读 · 0 评论 -
CodeForces 1072C Cram Time【思维题】
传送门:http://codeforces.com/problemset/problem/1072/C C. Cram Time time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output In a galaxy far,...原创 2018-10-22 18:04:59 · 478 阅读 · 0 评论 -
codeforces 1062C. Banh-mi
传送门:http://codeforces.com/problemset/problem/1062/C 思路:先求出每个位置1和0个数的前缀和,肯定先干掉所有的1,再搞0,。所以可以这样推↓ 于是就可以O1查询了! 代码: #include<cstdio> #include<cmath> #include<algorithm> #include&l...原创 2018-11-16 10:32:53 · 294 阅读 · 0 评论 -
codeforces1077C Good Array(Codeforces Round #521 (Div. 3))
传送门:http://codeforces.com/contest/1077/problem/C 吐槽:忘记特判2的情况被hack了,肥宅大哭.jpg 代码: #include<cstdio> #include<cmath> #include<algorithm> #include<cstring> #include<string>...原创 2018-11-18 13:49:24 · 275 阅读 · 0 评论 -
codeforces 1077D. Cutting Out(Codeforces Round #521 (Div. 3))
传送门:http://codeforces.com/contest/1077/problem/D 幸好这题没被hack QAQ 代码: #include<cstdio> #include<cmath> #include<algorithm> #include<cstring> #include<string> #include&l...原创 2018-11-18 14:56:05 · 309 阅读 · 0 评论