A + B Problem II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 220509 Accepted Submission(s): 42365
Problem Description
I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.
Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line consists of two positive integers, A and B. Notice that the integers are very large, that means you should not process them by using 32-bit integer. You may assume the length of each integer will not exceed 1000.
Output
For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line is the an equation "A + B = Sum", Sum means the result of A + B. Note there are some spaces int the equation. Output a blank line between two test cases.
Sample Input
2 1 2 112233445566778899 998877665544332211
Sample Output
Case 1: 1 + 2 = 3 Case 2: 112233445566778899 + 998877665544332211 = 1111111111111111110#include<stdio.h> #include<string.h> int a[1010],b[1010]; char s1[1010],s2[1010]; void changenum(char *s,int *a) { int start,end,i,t; start=0;end=strlen(s)-1; for(i=0;i<strlen(s);i++) { a[i]=s[i]-'0'; } while(start<end) { t=a[start]; a[start]=a[end]; a[end]=t; start++; end--; } } int main() { int T,j,i; scanf("%d",&T); for(j=1;j<=T;j++) { memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); scanf("%s%s",s1,s2); changenum(s1,a); changenum(s2,b); for(i=0;i<1010;i++) { a[i]=a[i]+b[i]; if(a[i]>9) { a[i]=a[i]%10; a[i+1]++; } } for(i=1009;i>=0;i--) { if(a[i]) break; } printf("Case %d:\n%s + %s = " , j, s1, s2); if(i<0) printf("0\n"); else { for(;i>=0;i--) printf("%d",a[i]); printf("\n"); } if(j<T) printf("\n");//注意细节,最后一组数据不输出换行,这是和 nyoj 上不一样的地方!!!! } return 0; }