cf
swpu_cd
弱校acmer,努力刷题多学算法
展开
-
Educational Codeforces Round 88
A,B,C,D,E原创 2020-05-29 17:05:31 · 192 阅读 · 0 评论 -
Codeforces Round #643
A,B,C,D,E原创 2020-05-22 19:03:01 · 180 阅读 · 0 评论 -
Codeforces Round #642
A,B,C,D,E原创 2020-05-15 21:16:54 · 184 阅读 · 0 评论 -
Codeforces Round #638
A,B,C,D原创 2020-05-05 21:46:15 · 112 阅读 · 0 评论 -
Educational Codeforces Round 86
A,B,C, D,E原创 2020-04-27 18:41:17 · 155 阅读 · 0 评论 -
Codeforces Round #630 (Div. 2)
A、B、C、D、E原创 2020-04-04 18:59:45 · 114 阅读 · 0 评论 -
Codeforces Round #620 (Div. 2)
A、B、C、D、E原创 2020-02-16 16:06:40 · 106 阅读 · 0 评论 -
Codeforces Round #605 (Div. 3)
A暴力模拟每个点坐标-1,不变,+1的情况#include <bits/stdc++.h>using namespace std;typedef long long ll;ll dis(ll a, ll b, ll c) { return abs(a - b) + abs(b - c) + abs(a - c);}int main(){ int q;...原创 2019-12-13 20:38:53 · 68 阅读 · 0 评论 -
Codeforces Round #604 (Div. 2)
A暴力#include <bits/stdc++.h>using namespace std;const int maxn = 1e5 + 5; int main(){ //freopen("in.txt", "r", stdin); int t; cin >> t; while (t--) { string str; cin >> ...原创 2019-12-07 10:24:41 · 115 阅读 · 0 评论 -
Codeforces Round #600 (Div. 2)
A记录除0的相同权值联通块个数#include <bits/stdc++.h>using namespace std;const int maxn = 1e5 + 5;#define endl '\n'int a[maxn], b[maxn]; int main(int argc, char const *argv[]){ //freopen("in.txt",...原创 2019-11-18 15:23:47 · 78 阅读 · 0 评论 -
Educational Codeforces Round 75 (Rated for Div. 2)
A判断连续出现的相同字符是偶数还是奇数#include <bits/stdc++.h>using namespace std;#define endl '\n'const int maxn = 1e5 + 5;int vis[30];int main(){ ios::sync_with_stdio(false); cin.tie(0); int t;...原创 2019-10-25 12:07:48 · 135 阅读 · 1 评论 -
Codeforces Round #595 (Div. 3)
A若i存在i-1,i+1时即必须分2组,其余1组#include <bits/stdc++.h>using namespace std;#define endl '\n'const int maxn = 1e2 + 5;int a[maxn];int cnt[maxn];int main(){ int q; cin >> q; whil...原创 2019-10-24 20:26:15 · 153 阅读 · 0 评论 -
Codeforces Round #593 (Div. 2)
A暴力计算#include <bits/stdc++.h>using namespace std;#define endl '\n' int main(){ int t; cin >> t; while (t--) { int a, b, c; cin >> a >> b >> c; ...原创 2019-10-18 17:03:56 · 176 阅读 · 0 评论 -
Educational Codeforces Round 65 (Rated for Div. 2)
A按题意判断第11起存不存在为8的情况#include <bits/stdc++.h>using namespace std;void solve() { int n; cin >> n; string str; cin >> str; reverse(str.begin(), str.end()); for (int...原创 2019-10-17 20:46:00 · 110 阅读 · 0 评论 -
cf #578 div2
A暴力#include <bits/stdc++.h>using namespace std;const int maxn = 1e5 + 5;char str[maxn];int room[20]; int main(){ ios::sync_with_stdio(false); cin.tie(0); int n; cin >...原创 2019-08-30 17:09:42 · 124 阅读 · 0 评论 -
Codeforces Round #582 (Div. 3)
A输出奇数位和偶数位的最大值即可#include <bits/stdc++.h>using namespace std;const int maxn = 100 + 5; int main(){ int cntodd = 0, cnteven = 0, n; cin >> n; for (int i = 0; i < n; ++i) ...原创 2019-09-04 20:30:49 · 84 阅读 · 0 评论 -
Codeforces Round #577 (Div. 2)
A记录每道题的最多选项个数#include <bits/stdc++.h>using namespace std;const int maxn = 1000 + 5;int a[maxn], op[maxn][10];char in[maxn];int main(){ ios::sync_with_stdio(false); cin.tie(0); ...原创 2019-09-06 11:58:12 · 88 阅读 · 0 评论 -
Codeforces Round #574 (Div. 2)
A暴力记录最多能形成多少对#include <bits/stdc++.h>using namespace std;const int maxn = 1000 + 5;int a[maxn]; int main(){ ios::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n &g...原创 2019-09-11 17:55:43 · 78 阅读 · 0 评论 -
Codeforces Round #588 (Div. 2)
A暴力划分2/2,1/3判定#include <bits/stdc++.h>using namespace std; int main(){ //freopen("in.txt", "r", stdin); int a[5], sum = 0; for (int i = 0; i < 4; ++i) { cin >> a[i]; sum ...原创 2019-09-24 11:33:48 · 202 阅读 · 0 评论 -
Educational Codeforces Round 74 (Rated for Div. 2)
A除了1以外每个数都可以被质数构成#include <bits/stdc++.h>using namespace std;typedef long long ll; int main(){ int t; cin >> t; while (t--) { ll x, y; cin >> x >> y; ...原创 2019-10-09 22:08:00 · 84 阅读 · 0 评论 -
cf #581 div2
A暴力检查即可#include <bits/stdc++.h>using namespace std;const int maxn = 200 + 5;int dig[maxn];int main(){ ios::sync_with_stdio(false); cin.tie(0); string str; cin >>...原创 2019-08-29 16:04:01 · 96 阅读 · 0 评论