Heptagonalwarrior
这个作者很懒,什么都没留下…
展开
-
第58期:Educational Codeforces Round 119 (Rated for Div. 2)
A. Equal or Not Equal tags:constructive algorithms dsu implementation *800solution: code: #include<bits/stdc++.h> using namespace std; int t; string s; int main(){ cin>>t; while(t--){ cin>>s; cout<<(count(s....原创 2022-03-17 19:29:26 · 227 阅读 · 0 评论 -
第57期:Codeforces-Round #777 (Div. 2)
1原创 2022-03-15 17:43:56 · 200 阅读 · 0 评论 -
第55期:Codeforces-Round #776 (Div. 3)
A. Deletions of Two Adjacent Letters tags: implementation strings solution: code: #include<bits/stdc++.h> using namespace std; int main(){ int t;cin>>t; while(t--){ char s[100]; string s1;char c; cin>>(s+1)>>s...原创 2022-03-15 00:03:44 · 173 阅读 · 0 评论 -
第54期:Codeforces-Round #775 (Div. 2, based on Moscow Open Olympiad in Informatics)
solved: B A. Game tags: implementation solution:比赛时没有认真读题,理解成了可以无限跨水跳,但是实际题意是只能不超过跳一次。 code: #include<bits/stdc++.h> using namespace std; void solve(){ int n,a[110]; cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; int l=1,..原创 2022-03-07 13:02:39 · 232 阅读 · 0 评论 -
第49期:Codeforces-Round #774(Div.2)
A. Square Counting 思路:意思就是s最多包含多少个。 #include<bits/stdc++.h> #define int long long using namespace std; int t,n,s; signed main(){ cin>>t; while(t--){ cin>>n>>s; cout<<s/(n*n)<<endl; } return 0; } B. Qualit原创 2022-03-05 18:02:17 · 54 阅读 · 0 评论 -
第50期:Codeforces-Round #764 (Div. 3)
A. Plus One on the Subset tags: math; *800 solution:ans=max{a[i]|1<=i<=n}-min{a[i]|1<=i<=n} code: #include<bits/stdc++.h> using namespace std; const int maxn=50+5; int t; int n,a[maxn]; int main(){ ios::sync_with_stdio(0); cin.原创 2022-03-05 22:25:25 · 69 阅读 · 0 评论 -
第51期:Codeforces-Round #762 (Div. 3)
A. Square String? tags: implementation; strings; *800 solution:简单模拟 code: #include<bits/stdc++.h> using namespace std; void solve(){ string s; cin>>s; int n=s.length(); if(n&1){ cout<<"NO\n"; return; } bool flag=true;原创 2022-03-05 23:47:22 · 52 阅读 · 0 评论