A + B Problem II
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 = 111111111111111111
#include<iostream>
#include<string>
using namespace std;
string add(string s1,string s2)
{
if(s1==""&&s2=="")return "0";//对"0"的处理
if(s1=="") return s2;
if(s2=="")return s1;
string max=s2,min=s1;
if(s1.length()>s2.length())
{
max=s1;
min=s2;
}
int a=max.length()-1,b=min.length()-1;
for(int i=b;i>=0;i--)//加法运算求和。
{
max[a--]+=min[i]-'0';
}
for(int j=max.length()-1;j>0;j--)
{
if(max[j]>'9')//判断是否进位。
{
max[j]=max[j]-10;
max[j-1]+=1;
}
}
if(max[0]>'9')//判断首元素是否进位。
{
max[0]-=10;
max='1'+max;
}
return max;
}
int main()
{
int n,i;
cin>>n;
for(i=1;i<=n;i++)
{
string s1,s2;
cin>>s1>>s2;
cout<<"Case "<<i<<":"<<endl;
cout<<s1<<" + "<<s2<<" = "<<add(s1,s2)<<endl;
if(i!=n)
cout<<endl;
}
return 0;
}
很显然,大数求和,要用字符串来处理,刚开始时,对"0"没做处理,遗憾。(特殊元素特殊处理)
当然用构造函数add(),还可以求多个数求和。。。