Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 287467 Accepted Submission(s): 55255
#include<stdio.h> #include<string.h> int main() { int n,j; scanf("%d",&n); for(j=0;j<n;j++) { int a[1200]={0},b[1200]={0},c[1200]={0},i,long1,long2,k; char a1[1200],b1[1200]; scanf("%s",a1); scanf("%s",b1); long1=strlen(a1); long2=strlen(b1); for(i=0;i<long1;i++) a[i]=a1[long1-i-1]-‘0‘; for(i=0;i<long2;i++) b[i]=b1[long2-i-1]-‘0‘; k=long1<long2?long2:long1; for(i=0;i<k;i++) c[i]=a[i]+b[i]; for(i=0;i<k;i++) if(c[i]>=10) { c[i+1]+=c[i]/10; c[i]%=10; } printf("Case %d:\n",j+1); printf("%s + %s = ",a1,b1); if(c[k]==0) k--; for(i=k;i>=0;i--) printf("%d",c[i]); if(j==n-1) printf("\n"); else printf("\n\n"); } return 0; }
原文:http://www.cnblogs.com/tt-t/p/5073836.html