A + B Problem II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 236370 Accepted Submission(s): 45487
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
21 2112233445566778899 998877665544332211
Sample Output
Case 1:1 + 2 = 3 Case 2:112233445566778899 + 998877665544332211 = 1111111111111111110
#include<stdio.h>
#include<string.h>
int main()
{
char a[2001],b[2001],c[2001];
int n=0,k,i,j,m;
scanf("%d",&k);
getchar();
for(i=0;i<k;i++)
{
int flag=0;
scanf("%s %s",a,b);
printf("Case %d:\n",n=n+1);
for(j=0;j<strlen(a);j++) printf("%c",a[j]);
printf(" + ");
for(j=0;j<strlen(b);j++) printf("%c",b[j]);
printf(" = ");
if(strlen(a)<strlen(b))
{
strcpy(c,a);
strcpy(a,b);
strcpy(b,c);
}//保证a最长
for(j=strlen(a)-1,m=strlen(b)-1;m>=0;j--,m--)
{//到最短的b的0位
if (a[j]-'0'+b[m]-'0'>=10)
{
a[j]=(a[j]-'0'+b[m]-'0')%10+'0';
if (m==0) flag=1; //标记是否要进1
else a[j-1]=a[j-1]+1;
}
else a[j]=a[j]+b[m]-'0';
}
int cc=strlen(a)-strlen(b)-1;
if(flag==1&&cc==-1) printf("1"); //两数等长情况
else if (flag==1&&cc!=-1)
{
if(a[cc]-'0'+1>=10)
{
while(a[cc]-'0'+1>=10)
{
a[cc]='0';
if (cc==0) //循环到第一项进1时
{
printf("1");
break;
}
cc=cc-1; //非第一项要进1
a[cc]=a[cc]+1;
}
}
else a[cc]=a[cc]+1;
}
for(j=0;j<strlen(a);j++) printf("%c",a[j]);
printf("\n");
if (i!=k-1) printf("\n"); //两结果间输出空行情况
}
return 0;
}