A + B Problem II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 428374 Accepted Submission(s): 83225
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 99887766554433221
Sample Output
Case 1:
1 + 2 = 3
Case 2:
112233445566778899 + 998877665544332211 = 1111111111111111110
Author
Ignatius.L
问题分析:大数加法,C语言用字符数组,C++用字符串
AC的C语言代码:
#include<stdio.h>
#include<string.h>
#define max(a,b) a>b?a:b
#define N 1000
char sa[N+1],sb[N+1];
int a[N+1],b[N+1];
int main()
{
int i,j,k,t;
scanf("%d",&t);
for(k=1;k<=t;k++){
scanf("%s%s",sa,sb);
//字符串转数值数组
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
int alen=strlen(sa);
int blen=strlen(sb);
for(i=alen-1,j=0;i>=0;i--,j++)
a[j]=sa[i]-'0';
for(i=blen-1,j=0;i>=0;i--,j++)
b[j]=sb[i]-'0';
//相位相加
int len=max(alen,blen);
int carry=0;
for(i=0;i<len;i++){
a[i]+=b[i]+carry;
carry=a[i]/10;
a[i]%=10;
}
if(carry!=0)
a[len++]=carry;
//输出
printf("Case %d:\n",k);
printf("%s + %s = ",sa,sb);
for(i=len-1;i>=0;i--)
printf("%d",a[i]);
printf("\n");
if(k!=t)
printf("\n");
}
return 0;
}
AC的C++代码:
#include<iostream>
#include<cmath>
#include<string>
using namespace std;
int main()
{
int t,i,j;
string a,b,A,B;
cin>>t;
for(i=1;i<=t;i++){
cin>>A>>B;
a=A;
b=B;
string add=(a.length()>b.length())?a:b;
int len=abs((int)(a.length()-b.length()));
if(a.length()>b.length())
b.insert(0,len,'0');
else
a.insert(0,len,'0');
int carry=0;
for(j=a.length()-1;j>=0;j--){
add[j]=(carry+(a[j]-'0')+(b[j]-'0'))+'0';
if(j!=0){
if(add[j]>'9'){
add[j]-=10;
carry=1;
}
else
carry=0;
}
}
if(add[0]>'9'){
add[0]-=10;
add.insert(0,1,'1');
}
cout<<"Case "<<i<<":"<<endl;
cout<<A<<" + "<<B<<" = "<<add<<endl;
if(i!=t)
cout<<endl;
}
return 0;
}