bettle_king的博客

https://codeforces.com/problemset/problem/520/B#include<bits/stdc++.h>using namespace std;typedef long long int LL;const int N=1e5+10;LL n,m,dist[N];int bfs(int n){ unordered_map<int,int>mp; queue<int>q; q.push(n),mp[n]++,dist[.

https://codeforces.com/problemset/problem/1256/A#include<bits/stdc++.h>using namespace std;int main(void){ int t; cin>>t; while(t--) { int cnt1,cnt2,val,s; cin>>cnt1>>cnt2>>val>>s; s-=val*min(cnt1,s/val); .

https://codeforces.com/problemset/problem/1359/A一个人拿的最多，剩下的每一个人尽可能的平分。#include<bits/stdc++.h>using namespace std;int main(void){ int t; cin>>t; while(t--) { int n,m,k; cin>>n>>m>>k; int ans1=min(n/k,m); m=m-ans1.

https://codeforces.com/problemset/problem/124/A#include<bits/stdc++.h>using namespace std;int main(void){ int n,a,b; cin>>n>>a>>b; int ans1=n-a; int ans2=b+1; cout<<min(ans1,ans2); return 0;}

https://codeforces.com/problemset/problem/742/A#include<bits/stdc++.h>using namespace std;int ans[25]={0,8,4,2,6,8,4,2,6};int main(void){ int n; cin>>n; if(n)cout<<ans[n%4+4]; else cout<<1; return 0;}

https://codeforces.com/problemset/problem/499/B#include<bits/stdc++.h>using namespace std;map<string,string>mp;int main(void){ int n,m; cin>>n>>m; for(int i=0;i<m;i++) { string a,b; cin>>a>>b; if(a.size().

https://codeforces.com/problemset/problem/1353/C#include<bits/stdc++.h> using namespace std;typedef long long int LL;int main(void){ int t; cin>>t; while(t--) { LL n; cin>>n; LL len=n/2+1; LL sum=0; for(int i=1;i<=len;.

https://codeforces.com/problemset/problem/476/A#include<bits/stdc++.h>using namespace std;int ans=1e9;int main(void){ int n,m; cin>>n>>m; for(int i=0;i<=10000;i++) { for(int j=0;2*j<=n;j++) { int sum=i+j*2; if(sum.

https://codeforces.com/problemset/problem/577/A#include<bits/stdc++.h>using namespace std;int main(void){ int n,x; cin>>n>>x; int cnt=0; for(int i=1;i<=x/i;i++) { if(x%i==0&&i<=n&&x/i<=n) { cnt++;.

https://codeforces.com/problemset/problem/43/A#include<bits/stdc++.h>using namespace std;map<string,int>mp;int main(void){ int n; cin>>n; while(n--) { string s; cin>>s; mp[s]++; } int cnt=0; string ans; for(auto i.

https://codeforces.com/problemset/problem/1342/A#include<bits/stdc++.h>using namespace std;typedef long long int LL;int main(void){ LL t; cin>>t; while(t--) { LL x,y,a,b; cin>>x>>y>>a>>b; LL sum=0; if(2*a&.

https://codeforces.com/problemset/problem/1374/C#include<bits/stdc++.h>using namespace std;int t;int main(void){ cin>>t; while(t--) { int n; cin>>n; string s; getline(cin,s); getline(cin,s); stack<char>st; for(.

https://codeforces.com/problemset/problem/584/A高精度写法#include<bits/stdc++.h>using namespace std;vector<int>ve;vector<int> mul(vector<int> A,int b){ int t=0; vector<int>C; for(int i=0;i<A.size()||t;i++) { if(i&lt.

https://codeforces.com/problemset/problem/579/A解题思路：将n分解为多个2的几次幂相加，直接位运算找就行。。#include<bits/stdc++.h>using namespace std;int ans=0;int lowbit(int x){ return x&-x;}int main(void){ int x; cin>>x; int ans=0; while(x) ans++

https://codeforces.com/problemset/problem/379/A#include<bits/stdc++.h>using namespace std;int main(void){ int n,m; cin>>n>>m; int sum=n; while(n>=m) { sum+=n/m; n=n/m+n%m; } cout<<sum; return 0;}

https://codeforces.com/problemset/problem/500/A#include<bits/stdc++.h>using namespace std;int main(void){ int n,m; cin>>n>>m; int startx=1; bool flag=0; for(int i=1;i<=n-1;i++) { int a; cin>>a; if(startx==i) startx+.

https://codeforces.com/problemset/problem/339/B#include<bits/stdc++.h>using namespace std;int n,m,startx=1;long long int sum;int main(void){ cin>>n>>m; for(int i=0;i<m;i++) { int s; cin>>s; if(s>=startx) sum+=s-s.

https://codeforces.com/problemset/problem/230/A#include<bits/stdc++.h>using namespace std;bool flag=true;vector<pair<int,int>>ve;int main(void){ int s,t; cin>>s>>t; for(int i=0;i<t;i++) { int a,b; cin>>a&.

https://codeforces.com/problemset/problem/131/A#include<bits/stdc++.h>using namespace std;int cnt;int main(void){ string s; cin>>s; for(int i=0;i<s.size();i++) if(s[i]<='Z') cnt++; if(cnt==s.size()||( (cnt==s.size()-1) &&.

https://codeforces.com/problemset/problem/479/A#include<bits/stdc++.h>using namespace std;int ans=0;int main(void){ int a,b,c; cin>>a>>b>>c; ans=max(ans,a+b+c); ans=max(ans,a+b*c); ans=max(ans,a*(b+c)); ans=max(ans,(a+b)*.

https://codeforces.com/problemset/problem/122/A#include<bits/stdc++.h>using namespace std;vector<int>ans;void dfs(int sum,int index){ ans.push_back(sum); if(index==3) return; dfs(sum*10+4,index+1); dfs(sum*10+7,index+1);}int main(vo.

https://codeforces.com/problemset/problem/58/A#include<bits/stdc++.h>using namespace std;string a="hello";int cnt=0;int main(void){ string s; cin>>s; for(int i=0;i<s.size();i++) { if(s[i]==a[cnt]) cnt++; } if(cnt==5) puts("YES".

https://codeforces.com/problemset/problem/69/A#include<bits/stdc++.h>using namespace std;int t,ans1,ans2,ans3;int main(void){ cin>>t; while(t--) { int a,b,c; cin>>a>>b>>c; ans1+=a,ans2+=b,ans3+=c; } if(!ans1&amp.

https://codeforces.com/problemset/problem/118/A#include<bits/stdc++.h>using namespace std;string s;int main(void){ cin>>s; for(int i=0;i<s.size();i++) { s[i]=tolower(s[i]); if(s[i]!='a'&&s[i]!='e'&&s[i]!='i'&.

https://codeforces.com/problemset/problem/1/A#include<bits/stdc++.h>using namespace std;int main(void){ long long int n,m,a; cin>>n>>m>>a; long long int cnt1=0,cnt2=0; cnt1=n/a; cnt2=m/a; if(n%a) cnt1++; if(m%a) cnt2++; .

https://codeforces.com/problemset/problem/96/A#include<bits/stdc++.h>using namespace std;bool flag=false;int main(void){ string s; cin>>s; int cnt=1; for(int i=0;i<s.size();i++) { if(i&&s[i-1]==s[i]) cnt++; else cnt=1;.

#include<bits/stdc++.h>using namespace std;string s;vector<int>ve;int main(void){ cin>>s; int sum=0; for(int i=0;i<s.size();i++) { if(s[i]!='+') { sum=sum*10+s[i]-'0'; } else { ve.push_back(sum); sum=0;.

https://codeforces.com/problemset/problem/112/A#include<bits/stdc++.h>using namespace std;string s1,s2;void f(string &s){ for(int i=0;i<s.size();i++) s[i]=tolower(s[i]);}int main(void){ cin>>s1>>s2; f(s1),f(s2); if(s1&.

https://codeforces.com/problemset/problem/263/A#include<bits/stdc++.h> using namespace std;int a[10][10];int x,y;int main(void){ for(int i=1;i<=5;i++) for(int j=1;j<=5;j++) { cin>>a[i][j]; if(a[i][j]) x=i,y=j; } cout.

https://codeforces.com/problemset/problem/282/A#include<bits/stdc++.h>using namespace std;int t;string s;int ans;int main(void){ cin>>t; while(t--) { cin>>s; if(s.find("+")!=-1) ans++; else ans--; } cout<<ans; r.

https://codeforces.com/problemset/problem/50/A#include<bits/stdc++.h>using namespace std;int main(void){ int n,m; cin>>n>>m; cout<<n*m/2<<endl; return 0;}

https://codeforces.com/problemset/problem/158/A#include<bits/stdc++.h>using namespace std;const int N=1e5+10;int n,m,cnt,s[N];int main(void){ cin>>n>>m; for(int i=1;i<=n;i++) cin>>s[i]; int temp=s[m]; for(int i=1;i<.

https://codeforces.com/problemset/problem/231/A#include<bits/stdc++.h>using namespace std;int ans;int main(void){ int t; cin>>t; while(t--) { int a,b,c; cin>>a>>b>>c; int sum=a+b+c; if(sum>=2) ans++; } cout.

https://codeforces.com/problemset/problem/71/A#include<bits/stdc++.h>using namespace std;int main(void){ int t; cin>>t; while(t--) { string s; cin>>s; if(s.size()<=10) cout<<s<<endl; else { cout<<s.

https://codeforces.com/problemset/problem/4/A可以平分成两个偶数，就是YES否则就是NO#include<bits/stdc++.h>using namespace std;int main(void){ long long int x; cin>>x; if(x&1||x==2) puts("NO"); else puts("YES"); return 0;}...