cf
Z&C
这个作者很懒,什么都没留下…
展开
-
C. League of Leesins
题解:这道题挺有意思的,主要是不停地把队尾元素一个个删除,然后再输出,这样就可以保证顺序不出错。代码:#include<bits/stdc++.h>using namespace std;typedef long long ll;const ll maxn=1e5+20;set<ll> pos[maxn],two,one;ll q[maxn][3];int ...原创 2019-11-22 16:44:00 · 447 阅读 · 0 评论 -
D. Shichikuji and Power Grid
codeforce链接昨天看到这道图论题感觉挺有意思的,记录下来。代码:#include<iostream>#include<algorithm>#include<cstdio>#include<vector>#include<stack> #include<cstring>#include<map&g...原创 2019-11-02 14:47:14 · 127 阅读 · 0 评论 -
Codeforces Round #582 (Div. 3)
链接:http://codeforces.com/contest/1213A. Chips Moving题意:向右向左+2,-2免费,+1,-1花费为1,求多少花费才能使全部数字相同代码:#include<iostream>#include<algorithm>#include<cstdio>#include<vector>#incl...原创 2019-08-31 14:15:32 · 88 阅读 · 0 评论 -
Educational Codeforces Round 72 (Rated for Div. 2)
链接:http://codeforces.com/contest/1217A. Creating a Character#include<iostream>#include<algorithm>#include<cstdio>#include<vector>#include<stack> #include<cstrin...原创 2019-09-06 22:27:35 · 84 阅读 · 0 评论 -
Codeforces Round #583 (Div. 1 + Div. 2, based on Olympiad of Metropolises)
链接:http://codeforces.com/contest/1214A. Optimal Currency Exchange#include<iostream>#include<algorithm>#include<cstdio>#include<vector>#include<stack> #include<c...原创 2019-09-06 22:31:51 · 75 阅读 · 0 评论 -
Educational Codeforces Round 73 (Rated for Div. 2)
链接:http://codeforces.com/contest/1221A. 2048 Game代码:#include<iostream>#include<algorithm>#include<cstdio>#include<vector>#include<stack> #include<cstring>#...原创 2019-09-21 13:23:47 · 104 阅读 · 0 评论 -
Codeforces Round #587 (Div. 3)
链接:http://codeforces.com/contest/1216A. Prefixes代码:#include<iostream>#include<algorithm>#include<cstdio>#include<vector>#include<stack> #include<cstring>#i...原创 2019-09-22 10:17:45 · 198 阅读 · 0 评论