#include <iostream> #include <cstdio> #include <sstream> #include <string> using namespace std; int main() { int n,cnt; string s,t; stringstream ss; while(cin>>s) { if(s=="END") break; n=s.size(); cnt=1; ss.clear(); ss<<n; ss>>t; while(s!=t) { s=t; n=s.size(); ss.clear(); ss<<n; ss>>t; cnt+=1; } cout<<cnt<<"\n"; } return 0; }
Year: 2015
11634
#include <iostream> #include <cstring> #include <string> using namespace std; bool trace[10000]; int random(int n) { int a=n*n; int arr[10]; int k=8; while(a) { arr[k]=a%10; k-=1; a/=10; } for(int i=k;i>=1;i–) arr[i]=0; int num=0; for(int i=3;i<=6;i++) { num*=10; num+=arr[i]; } return num; } int main() { int n,k; int cnt; while(cin>>n) { if(n==0) break; memset(trace,0,sizeof(trace)); cnt=1; int
12243
Need to know a little more about string.char an locale library. #include <iostream> #include <cstdio> #include <cstring> #include <string> #include <locale> using namespace std; int main() { string str; locale loc; while(getline(cin,str)) { if(str=="*") break; char ch1; char ch=str[0]; if(isupper(ch,loc)) ch1=tolower(ch,loc); else ch1=toupper(ch,loc); //cout<<ch<<" "<<ch1<<"\n"; bool tautogram=1; for(int i=1;i<str.size();i++) { if(str[i]==' ') { if(i+1<str.size() &&
333
Careful about the problem description, things to check : there are no more than 10 digits X is at the 10th position to avoid PE avoid the trailing and leading spaces and keep the internal spaces #include <iostream> #include <cstdio> #include <cstring> #include <string> using namespace std; int num[15]; int main() { string str,p; while(getline(cin,str))
12748
#include <iostream> #include <cstdio> using namespace std; struct router{ int x,y,r; }; struct location{ int x,y; }; router rr[105]; location loc[12]; int main() { int t,kase=1; int a,b,c,d,e; bool f,found; cin>>t; int routers,locations; while(t–) { cin>>routers>>locations; f=0; for(int i=0;i<routers;i++) { cin>>rr[i].x>>rr[i].y>>rr[i].r; } for(int i=0;i<locations;i++) { cin>>loc[i].x>>loc[i].y; } for(int i=0;i<locations;i++) { a=loc[i].x;b=loc[i].y; found=0; for(int j=0;j<routers;j++) {
12854
#include <iostream> #include <cstdio> #include <cstring> #include <string> using namespace std; int connector1[5]; int connector2[5]; int main() { bool f; while(scanf("%d",&connector1[0])!=EOF) { for(int i=1;i<5;i++) cin>>connector1[i]; for(int i=0;i<5;i++) cin>>connector2[i]; f=1; for(int i=0;i<5;i++) { if(connector1[i]+connector2[i]!=1) { f=0; break; } } if(f) cout<<"Y\n"; else cout<<"N\n"; } }
11063
This one is a shitty problem. #include <iostream> #include <cstdio> #include <cstring> using namespace std; bool arr[20000+5]; int main() { int n,a,kase=1; int prev=-1; int val[105]; bool Bseq; while(scanf ("%d", &n) != EOF) { Bseq=1; for(int i=0;i<n;i++) { cin>>val[i]; } for(int i=0;i<n-1;i++) { if(val[i]<1 || val[i]>=val[i+1]) { Bseq=0; break; } } if(Bseq) { memset(arr,0,sizeof(arr)); for(int
467
#include <iostream> #include <cstdio> #include <sstream> #include <string> #include <cstring> #include <algorithm> using namespace std; int signal[4000]; int main() { string str; int kase=1; stringstream ss; int a,b,c,mx; int arr[12]; while(getline(cin,str)) { ss.clear(); ss<<str; int k=1; int time=0; while(ss>>arr[k])k++; sort(arr+1,arr+k); memset(signal,0,sizeof(signal)); for(int i=1;i<k;i++) { for(int j=0;j<3601;) { a=arr[i]-5; b=5; c=arr[i]; while(a–)signal[j++]++; while(b–)signal[j++]=0; while(c–)signal[j++]=0; } }
507
#include <iostream> #include <cstdio> using namespace std; int arr[25000]; struct path{ int len,st,en; }; path p; int kadanesAlgo(int rd,int first) { int max_end_here=0,max_so_far=0; int begin=first,length; int finish=0,start=first; for(int i=first;i<rd;i++) { max_end_here+=arr[i]; if(max_end_here<0) { max_end_here=0; begin=i+1; } if(max_end_here>max_so_far) { max_so_far = max_end_here; start=begin; finish=i+1; length=finish-start+1; p.len=length; p.en=finish; p.st=start; } else if(max_end_here==max_so_far) { max_so_far = max_end_here; start=begin;
10196
#include <iostream> #include <string> #include <cstring> #include <cstdio> using namespace std; char board[8][8]; struct IDX{ int i,j; }; bool isCheck_knight(int I,int J,int color) { int dx[8]={1,1,-1,-1,2,2,-2,-2}; int dy[8]={2,-2,2,-2,1,-1,1,-1}; int a,b; for(int i=0;i<8;i++) { a=dx[i]+I; b=dy[i]+J; if(a>=0 && a<8 && b>=0 && b<8) { if(board[a][b]=='N' && color==0) return 1; else if(board[a][b]=='n' && color==1) return 1; }