codeforces
文章平均质量分 61
未来会更好_PYY
这个作者很懒,什么都没留下…
展开
-
1375C - Element Extermination
#include<iostream>using namespace std;int main(){ int t; cin>>t; while(t--){ int n; cin>>n; int arr[n+1]; for(int i=0;i<n;i++){ cin>>arr[i]; } if(arr[0]>arr[n-1]){ cout<<"NO"<<endl; }else{原创 2020-07-10 22:02:51 · 132 阅读 · 0 评论 -
1375B - Neighbor Grid
#include<iostream>using namespace std;int main(){ int t; cin>>t; while(t--){ int n,m; cin>>n>>m; int arr[n+1][m+1]; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ cin>>arr[i][j]; } } int cmp[n+1]原创 2020-07-10 20:45:54 · 192 阅读 · 0 评论 -
1375A - Sign Flipping
#include<iostream>using namespace std;int main(){ int t; cin>>t; while(t--){ int n; cin>>n; int arr[n+1]; for(int i=0;i<n;i++){ cin>>arr[i]; if(i%2==0&&arr[i]>0) arr[i] = -arr[i]; else if(i%2==1&原创 2020-07-10 19:37:46 · 131 阅读 · 0 评论 -
C. Move Brackets
#include<iostream>#include<cstring>using namespace std;int main(){ int t; cin>>t; for(int i=0;i<t;i++){ int n; cin>>n; char str[n+1]; cin>>str; char stack[n+1]; int j = 0,k = -1; while(str[j]!='\0'){原创 2020-07-04 21:35:08 · 1289 阅读 · 0 评论 -
1374B - Multiply by 2, divide by 6
#include<iostream>#include<cmath>using namespace std;int main(){ int num; cin>>num; for(int i=0;i<num;i++){ long int x; cin>>x; int count = 0; while(x!=1){ if(x%6==0){ x = x/6; }else{ if(x%3!=0){原创 2020-07-04 20:38:17 · 2089 阅读 · 0 评论 -
1374A - Required Remainder
#include<iostream>using namespace std;int main(){ int num; cin>>num; for(int i=0;i<num;i++){ long int x,y,n; cin>>x>>y>>n; long int count = n/x; if((count*x+y)<=n){ cout<<count*x+y<<endl; }原创 2020-07-04 19:53:05 · 1697 阅读 · 0 评论 -
1369B-AccurateLee
#include<iostream>#include<cstring>using namespace std;int main(){ int n; cin>>n; for(int k=0;k<n;k++){ int len; cin>>len; char str[100000]; cin>>str; int i = 0,j = len-1; while(str[i]!='1') i++; while(原创 2020-06-25 16:41:16 · 158 阅读 · 0 评论 -
1370A-Maximum GCD
#include<iostream>using namespace std;int main(){ int n; cin>>n; for(int i=0;i<n;i++){ int num; cin>>num; cout<<num/2<<endl; }}原创 2020-06-22 19:22:02 · 186 阅读 · 0 评论 -
116A - Tram
#include<iostream>using namespace std;int main(){ int n; cin>>n; int max = 0; int real = 0; for(int i=0;i<n;i++){ int s1,s2; cin>>s1>>s2; int k = real-s1+s2; real = real-s1+s2; if(max<k){ max = k; } }原创 2020-06-22 00:05:17 · 101 阅读 · 0 评论 -
546A - Soldier and Bananas
#include<iostream>using namespace std;int main(){ int first,avil,need; cin>>first>>avil>>need; int ans = first*((need+1)*need/2)-avil; if(ans>0){ cout<<ans<<endl; }else{ cout<<0<<endl; }}原创 2020-06-21 23:45:58 · 89 阅读 · 0 评论 -
236A - Boy or Girl
#include<iostream>#include<cstring>using namespace std;int main(){ char str[101]; cin>>str; int count[26]; memset(count,0,sizeof(count)); int i = 0; int ans = 0; while(str[i]!='\0'){ int num = str[i] - 'a'; count[num]++;原创 2020-06-21 23:45:17 · 194 阅读 · 0 评论 -
266A-Stones on the Table
#include<iostream>#include<cstring>using namespace std;int main(){ char str[55]; int i = 1; int n; cin>>n; cin>>str; int ans = 0; while(str[i]!='\0'){ if(str[i]==str[i-1]){ ans++; } i++; } cout<<ans<&l原创 2020-06-21 23:09:32 · 117 阅读 · 0 评论 -
281A-Word Capitalization
#include<iostream>#include<cstring>using namespace std;int main(){ char str[1001]; cin>>str; if(str[0]>='a'&&str[0]<='z'){ str[0] = str[0] - 32; } cout<<str<<endl;}原创 2020-06-21 23:08:58 · 113 阅读 · 0 评论 -
263A - Beautiful Matrix
#include<iostream>using namespace std;int abs(int a){ if(a<0){ return -a; }else{ return a; }}int main(){ int map[5][5]; int row = 0,column = 0; for(int i=0;i<5;i++){ for(int j=0;j<5;j++){ cin>>map[i][j]; if(map[原创 2020-06-21 20:37:24 · 142 阅读 · 0 评论 -
A. Petya and Strings
#include<iostream>#include<cstring>using namespace std;void invert(char str[]){// convert upper to lower int i = 0; while(str[i]!='\0'){ if(str[i]<='Z'&&str[i]>='A'){ str[i] = str[i] + 32; } i++; }}int compare(c原创 2020-06-21 20:19:51 · 254 阅读 · 0 评论 -
282A. Bit++
#include<iostream>#include<cstring>using namespace std;int main(){ int n; cin>>n; int x = 0; char str[4]; for(int i=0;i<n;i++){ cin>>str; if(str[1]=='+'){ x++; }else{ x--; } } cout<<x<<endl;}原创 2020-06-21 19:59:35 · 163 阅读 · 0 评论 -
50A Domino piling
#include<iostream>using namespace std;int main(){ int m,n; cin>>m>>n; int ans = 0; ans = (m/2)*n; if(m%2!=0){ ans+=(n/2); cout<<ans<<endl; }else{ cout<<ans<<endl; }}原创 2020-06-21 19:52:55 · 106 阅读 · 0 评论