- 博客(3)
- 收藏
- 关注
RSS订阅原创 AtCoder Beginner Contest 215 A - F 题解
A:link直接判断#include<bits/stdc++.h>using namespace std;string s2 = "Hello,World!"; int main(){ string s1; cin >> s1; if(s1 == s2) cout << "AC"; else cout << "WA";}B.link直接模拟，也可使用log函数#include<bits/stdc++.h>
2021-08-22 14:45:24
149
原创 Codeforces Round #739 (Div. 3)题解
A:link暴力 + 预处理#include<bits/stdc++.h>using namespace std;#define maxn 10005int a[maxn];int id = 0; void init(){ for(int i = 1;;i++){ int t = i; if(t % 3 == 0) continue; int flag = 0; if(t % 10 == 3) flag = 1; if(flag) continue;
2021-08-20 01:29:45
99
原创 Codeforces Round #686 (Div. 3) E
link基环树找环#include<bits/stdc++.h>using namespace std;#define maxn 600005#define ll long longint v[maxn], ne[maxn],h[maxn], in[maxn], pre[maxn];bool vis1[maxn];ll count1 = 0;ll cnt = 0,id = 0;void add(int a,int b){ v[id] = b,ne[id] = h[a],h
2021-06-26 15:16:26
74
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人