ACM入门题(北大oj).doc

#include<>intmain(){inta,b,c;while(scanf("%d%d",&a,&b)!=EOF){c=a+b;printf("%d\n",c);}}1067#include<>#include<>#include<>intmain(){inta,b;while(scanf("%d%d",&a,&b)!=EOF){if(a>b){intt=a;a=b;b=t;}intk=b-a;inta0=(int)(k*(1+sqrt())/2);if(a0==a)printf("0\n");elseprintf("1\n");}}1080#include<>#include<>inta[5][5]={5,-1,-2,-1,-3,-1,5,-3,-2,-4,-2,-3,5,-2,-2,-1,-2,-2,5,-1,-3,-4,-2,-1,0};intmain(){intca;scanf("%d",&ca);while(ca--){intn,m,i,j,max[105][105],b[105],d[105];chars[105],c[105];scanf("%d%s",&n,s);scanf("%d%s",&m,c);for(i=1;i<=n;i++){if(s[i-1]=='A')b[i]=0;if(s[i-1]=='C')b[i]=1;if(s[i-1]=='G')b[i]=2;if(s[i-1]=='T')b[i]=3;}for(i=1;i<=m;i++){if(c[i-1]=='A')d[i]=0;if(c[i-1]=='C')d[i]=1;if(c[i-1]=='G')d[i]=2;if(c[i-1]=='T')d[i]=3;}max[0][0]=0;for(i=1;i<=n;i++)max[i][0]=max[i-1][0]+a[b[i]][4];for(i=1;i<=m;i++)max[0][i]=max[0][i-1]+a[4][d[i]];for(i=1;i<=n;i++)for(j=1;j<=m;j++){max[i][j]=max[i-1][j-1]+a[b[i]][d[j]];if(max[i-1][j]+a[b[i]][4]>max[i][j])max[i][j]=max[i-1][j]+a[b[i]][4];if(max[i][j-1]+a[4][d[j]]>max[i][j])max[i][j]=max[i][j-1]+a[4][d[j]];}printf("%d\n",max[n][m]);}}1013#include<>#include<algorithm>#include<>#include<>#;structpoint{doublex;doubley;}p[30005],res[30005];intcmp(pointp1,pointp2){<||(==&&<);}boolral(pointp1,pointp2,pointp3){if((-)*(-)<=(-)*(-))returntrue;returnfalse;}doubledis(pointp1,pointp2){returnsqrt((-)*(-)+(-)*(-));}intmain(){intn,m;while(scanf("%d%d",&n,&m)!=EOF){inti,j;for(i=0;i<n;i++)scanf("%lf%lf",&p[i].x,&p[i].y);sort(p,p+n,cmp);res[0]=p[0];res[1]=p[1];inttop=1;for(i=2;i<n;i++){while(top&&ral(res[top-1],res[top],p[i]))top--;res[++top]=p[i];}intlen=top;res[++top]=p[n-2];for(i=n-3;i>=0;i--){while(top!=len&&ral(res[top-1],res[top],p[i]))top--;res[++top]=p[i];}doublet=0;for(i=0;i<top;i++)t=t+dis(res[i],res[i+1]);printf("%.lf\n",t+2*PI*m);}}1149#include<