Theory: The key to figuring out this problem was to recognize that you needed to resolve cycles in the data – if you follow an item to the item that’s in its spot, and then the one that’s in the next one’s spot, until you reach the original item again, you’ll have a cycle of
Year: 2014
763
#include <iostream> #include <string> #include <stdio.h> #include <string.h> #define max(a,b) (a)>(b)?(a):(b) #define size 350 using namespace std; struct bignum{ int s[size]; int len; bignum() { len = 1; memset(s,0,sizeof(s)); } bignum operator = (const char *str) { len = strlen(str); for(int i= 0;i<len;i++) { s[len-1-i] = str[i]-'0'; } return *this; } bignum operator = (const
1584
#include <iostream> #include <string> using namespace std; int main() { string s,s1,p; int t; cin>>t; /*if("CCTC" > "CCCT") cout<<"CCTC"<<"\n"; else cout<<"CCCT"<<"\n"; */ while(t–) { cin>>s; p=s; for(int i=1;i<p.size();i++) { s1=""; s1.append(1u,p[i]); if((i+1)<p.size()) for(int j=i+1;j<p.size();j++) s1.append(1u,p[j]); if(s1.size()!=p.size()) { for(int k=0;k<i;k++) s1.append(1u,p[k]); } //cout<<s1<<" = s1\n"; if(s1<s) s = s1; } cout<<s<<"\n"; } return 0; }
12820
#include <iostream> #include <map> #include <string> using namespace std; map<int,int> np; map<char,int> mp; int main() { int n,kase=1; string s; while(cin>>n) { int cool=0; for(int i=0;i<n;i++) { cin>>s; if(s.size()==1) continue; mp.clear(); np.clear(); for(int i=0;i<s.size();i++) { mp[s[i]]++; } for(map<char,int>::iterator ii=mp.begin();ii!=mp.end();++ii) { np[ii->second]=1; } if(np.size()==mp.size()) cool++; } cout<<"Case "<<kase++<<": "<<cool<<"\n"; } }
12816
#include <iostream> #include <math.h> //#include <string> using namespace std; struct point{ double x; double y; }p[101]; int isIsosceles(int a,int b,int c) { //dist of p[a],p[b] double d1 = sqrt((p[a].x-p[b].x)*(p[a].x-p[b].x) + (p[a].y-p[b].y)*(p[a].y-p[b].y)); double d2 = sqrt((p.x-p[b].x)*(p.x-p[b].x) + (p.y-p[b].y)*(p.y-p[b].y)); double d3 = sqrt((p[a].x-p.x)*(p[a].x-p.x) + (p[a].y-p.y)*(p[a].y-p.y)); //cout<<d1<<" "<<d2<<" "<<d3<<"\n"; if((d1+d2)<=d3 || (d3+d1)<=d2 || (d3+d2)<=d1) return 0; else if(d1==d2
1583
#include <iostream> #include <algorithm> #include <vector> #include <map> #define lld long long using namespace std; int n; int digit_generator(int num) { int r=num; while(num) { r+=(num%10); num/=10; } if(r==n) return r; else return 0; } int main() { int t; cin>>t; while(t–) { cin>>n; if(n==11) { cout<<10<<"\n"; continue; } if(n<10) { if(n%2==0) cout<<n/2<<"\n"; else cout<<0<<"\n";
1585
#include <iostream> #include <stdio.h> #include <vector> #include <math.h> #include <string.h> using namespace std; int main() { int t,toAdd,sum; string s; cin>>t; while(t–) { cin>>s; sum = 0; toAdd = 0; for(int i=0;i<s.size();i++) { if(s[i]=='X') toAdd=0; else if(s[i]=='O') toAdd++; sum+=toAdd; } cout<<sum<<"\n"; } return 0; } //OOXXOXXOOO
1062
WA Code: #include <iostream> #include <map> #include <string> using namespace std; map<char,int> m,np; //vector<char> v; int main() { string str; int cnt; int kase=1; while(cin>>str) { if(str=="end") break; cnt=1; np.clear(); m.clear(); for(int i=0;i<str.size();i++) { if(m[str[i]]<(i+1)) m[str[i]]=i+1; } for(map<char,int>::iterator ii=m.begin();ii!=m.end();++ii) { cout<<ii->first<<" "<<ii->second<<"\n"; int pos=ii->second; char c=ii->first; int f=0; for(int i=0;i<pos;i++) { if(str[i]<c && np[str[i]]==0) {
12801
#include <iostream> #include <stdio.h> using namespace std; int circum[10001]; int main() { int C,N; int res=0; double div; while(cin>>C) { cin>>N; div=(double)C/N; for(int i=0;i<N;i++) { cin>>circum[i]; } circum[N]=circum[0]+C; for(int i=circum[0];i<circum[1];i++) { int dis=i; res=0; int f=1; for(int j=1;j<=N;j++) { if(dis<circum[j] && circum[j]<=(dis+div)) dis+=div; else { f=0; break; } } if(f) { res=1; break; } }
12802
#include <iostream> #include <stdio.h> #include <vector> using namespace std; int prime[1000001]; vector<int> v; int palin(int a) { if(a<=11) return 1; int org=a; int r=0; while(a) { r*=10; r+=(a%10); a/=10; } if(r==org) return 1; return 0; } int main() { for(int j=1;j<1000001;j++) prime[j]=0; for(int i=2;i<1000001/2;i++) { if(prime[i]==0) for(int j=i+i;j<1000001;j+=i) prime[j]=1; } for(int i=1;i<1000001;i++) { if(prime[i]==0) {