开始搞C++~

  最近开始搞C++，开始贴新代码喽~~

/*TASK:rideLANG:C++*/#include<iostream>#include<fstream>#include<string>using namespace std;int main(){ freopen("ride.in", "r", stdin); freopen("ride.out", "w", stdout); string s1, s2; cin>>s1; cin>>s2; int l1=s1.size(); int l2=s2.size(); int ans1=1,ans2=1; int i; for(i=0;i<l1;i++) ans1=(ans1*(s1[i]-64))%47; for(i=0;i<l2;i++) ans2=(ans2*(s2[i]-64))%47; if (ans1==ans2) cout<<"GO"<<endl; else cout<<"STAY"<<endl; return 0;}/*TASK:gift1LANG:C++*/#include<iostream>#include<fstream>#include<string>using namespace std;struct people{ string name; int money;}p[10];int main(){ freopen("gift1.in","r",stdin); freopen("gift1.out","w",stdout); int n,i,j,money,num; string name; scanf("%d", &n); for(i=0; i<n; i++) cin >>p[i].name; for(i=0; i<n; i++) { cin >>name >>money >>num; for(j=0; j<n; j++) if (p[j].name==name) break; if(num!=0) p[j].money+=money%num; p[j].money-=money; for(j=0; j<num; j++) { cin >>name; for(int k=0; k<n; k++) if(p[k].name==name) { p[k].money+=money/num; break; } } } for(i=0; i<n; i++) cout <<p[i].name <<" " <<p[i].money <<endl;return 0;}

/*TASK:fridayLANG:C++*/#include<iostream>#include<fstream>using namespace std;const int a[12]={31,28,31,30,31,30,31,31,30,31,30,31};int ans[7];bool leap(int x){ if (x%4==0 && x%100!=0 || x%400==0) return 1; return 0;}int main(){ freopen("friday.in","r",stdin); freopen("friday.out","w",stdout); int n,now,days,i,j; scanf("%d", &n); now=0; for(i=1900; i<1900+n; i++) for(j=0; j<12; j++) { days=a[j]; if (j==1 && leap(i)) days++; ans[(now+13)%7]++; now+=days; } printf("%d %d", ans[6], ans[0]); for(i=1; i<6; i++) printf(" %d", ans[i]); printf("/n"); return 0;}

/*TASK:beadsLANG:C++*/#include<iostream>#include<fstream>using namespace std;int n;char s[701];int main(){ freopen("beads.in","r",stdin); freopen("beads.out","w",stdout); int i,res=0,pre=0,curr=0,w=0,color=0; scanf("%d", &n); for(i=0; i<n; i++) cin >>s[i]; for(i=0; i<n; i++) s[n+i]=s[i]; for(i=0; i<n*2 && res<n; i++) { if (s[i]=='w') w++,curr++; else if (s[i]==color) w=0,curr++; else { color=s[i]; if (pre+curr > res) res=pre+curr; pre=curr-w; curr=w+1; w=0; } } if(pre+curr>res) res=pre+curr; printf("%d/n", res<n?res:n); return 0;}

/*TASK:milk2LANG:C++*/#include<iostream>#include<fstream>#include<algorithm>using namespace std;struct ttype{ int s,t;}a[5001];bool cmp(ttype x, ttype y){ return x.s<y.s;}int main(){ freopen("milk2.in","r",stdin); freopen("milk2.out","w",stdout); int n, i, ans1=0, ans2=0; scanf("%d", &n); for(i=0; i<n; i++) scanf("%d%d", &a[i].s, &a[i].t); sort(a, a+n, cmp); int st=a[0].s, ed=a[0].t; for(i=0; i<n; i++) { while(i<n && a[i].s<=ed) { if (a[i].t>ed) ed=a[i].t; i++; } if(ed-st>ans1) ans1=ed-st; if(i==n) break; if (a[i].s-ed>ans2) ans2=a[i].s-ed; st=a[i].s; ed=a[i].t; } printf("%d %d/n", ans1, ans2); return 0;}

/*TASK:transformLANG:C++*/#include<iostream>#include<fstream>#include<cstring>using namespace std;int main(){ freopen("transform.in","r",stdin); freopen("transform.out","w",stdout); int n,i,j; char a[11][11]; char b[11][11]; int res[10]; memset(res,0,sizeof(res)); scanf("%d", &n); for(i=1; i<=n; i++) for(j=1; j<=n; j++) cin >>a[i][j]; for(i=1; i<=n; i++) for(j=1; j<=n; j++) cin >>b[i][j]; for(i=1; i<=n; i++) for(j=1; j<=n; j++) { if(a[i][j]==b[j][n-i+1]) res[1]++; if(a[i][j]==b[n-i+1][n-j+1]) res[2]++; if(a[i][j]==b[n-j+1][i]) res[3]++; if(a[i][j]==b[i][n-j+1]) res[4]++; if(a[i][j]==b[i][j]) res[6]++; if(a[i][n-j+1]==b[j][n-i+1]) res[9]++; if(a[i][n-j+1]==b[n-i+1][n-j+1]) res[7]++; if(a[i][n-j+1]==b[n-j+1][i]) res[8]++; } for(i=1; i<10; i++) if(res[i]==n*n) { if(i<7) printf("%d/n", i); else printf("5/n"); break; } if(i==10) printf("7/n"); return 0; }