Z - A + B Problem II
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 <stdlib.h>
#include <string.h>
#include <memory.h>
int main()
{
int i,j,t,l1,l2;
char a[1001],b[1001];
int ans[1002];
memset(ans,0,sizeof(ans));
scanf("%d",&t);
for(i=1;i<=t;i++)
{
scanf("%s%s",a,b);
l1=strlen(a);
l2=strlen(b);
if(l1>=l2)
{
for(j=l1-1;j>=0;j--)
{
ans[j+1]=a[j]-'0';
}
for(j=l1-1;j>=l1-l2;j--)
{
ans[j+1]+=b[j-l1+l2]-'0';
if(ans[j+1]>9)
{
ans[j]++;
ans[j+1]=ans[j+1]%10;
}
}
}
else
{
for(j=l2-1;j>=0;j--)
{
ans[j+1]=b[j]-'0';
}
for(j=l2-1;j>=l2-l1;j--)
{
ans[j+1]+=a[j-l2+l1]-'0';
if(ans[j+1]>9)
{
ans[j]++;
ans[j+1]=ans[j+1]%10;
}
}
}
printf("Case %d:\n%s + %s = ",i,a,b);
for(j=0;j<=(l1>l2?l1:l2);j++)
{
if(j==0&&ans[j]==0) continue;
printf("%d",ans[j]);
}
printf("\n");
if(i!=t) printf("\n");
}
return 0;
}