AtCoder
ypw44
成为自己最想成为的人~
展开
-
AtCoder Beginner Contest 182 A~E
A#include<bits/stdc++.h> using namespace std; int main(){ int a,b; cin>>a>>b; cout<<2*a+100 - b<<endl; return 0;}B题意:就是找到一个数能被尽可能多的a[]数组里面的数整除。找到这个数输出就行了。因为只有1000,我们直接暴力即可。#include<bits/stdc++.h>#define原创 2020-11-09 17:37:18 · 234 阅读 · 0 评论 -
AtCoder Beginner Contest 181 A ~ E
A.题意:奇数偶数即可#include<bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; if(n % 2 == 0) cout<<"White"<<endl; else cout<<"Black"<<endl; return 0;}B.题意:就是给你多个区间的左右端点,然后让你求所有区间之和。思路:前缀和预处理一下,然后就直接加就行原创 2020-11-04 10:39:51 · 136 阅读 · 1 评论 -
AtCoder Beginner Contest 177 A ~ E
A - Don’t be late签到:#include<iostream>#include<algorithm> using namespace std; int main(){ double d,t,s; cin>>d>>t>>s; double ans = d / s; if(ans <= t) cout<<"Yes"<<endl; else cout<<"No"<<原创 2020-09-06 19:54:27 · 178 阅读 · 0 评论 -
AtCoder Beginner Contest 171
A签到#include<bits/stdc++.h> using namespace std; int main(){ char c; cin>>c; if(c>='A'&&c<='Z') cout<<"A"; else cout<<"a"<<endl;}B签到#include<bits/stdc++.h> using namespace std;int a[1111原创 2020-09-02 14:12:24 · 161 阅读 · 0 评论 -
AtCoder Beginner Contest 173 A ~ F(已经补完)
A签到:#include<iostream> using namespace std; int main(){ int n; cin>>n; int ans = 1000-n%1000; if(ans % 1000 == 0) cout<<0<<endl; else cout<<ans<<endl; return 0;}B签到#include<iostream>#inclu原创 2020-09-02 13:51:32 · 147 阅读 · 0 评论 -
AtCoder Beginner Contest 172
A签到:#include<iostream> using namespace std; int main(){int n; cin>>n; cout<<n+n*n+n*n*n<<endl; return 0;}B签到:#include<iostream>#include<algorithm> using namespace std; int main(){ string s; strin原创 2020-09-01 16:02:01 · 157 阅读 · 0 评论 -
AtCoder Beginner Contest 166 A ~~E
A水题:#include<iostream>using namespace std;int main(){ string s; cin>>s; if(s=="ABC") cout<<"ARC"<<endl; else cout<<"ABC"<<endl; return 0;} B水题:主要是看懂...原创 2020-05-03 22:26:41 · 174 阅读 · 0 评论 -
AtCoder Beginner Contest 165 A ~~D
A 水题:#include<bits/stdc++.h>using namespace std;int main(){ int k; cin>>k; int a,b; cin>>a>>b; for(int i=1;;i++){ if(i*k > b) { cout<&...原创 2020-05-03 11:25:12 · 210 阅读 · 0 评论