HDU1002 大数相加

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=1002

#include <iostream>

#include <string>

using namespace std;

void Add(string a,string b,char sum[],int& count)

{//大数加法

int len1 = a.length();//数a的长度

int len2 = b.length();//数b的长度

int i = len1-1,j = len2-1,temp = 0,carryIn = 0;//初始进位为0

count = 0;

while(i>=0&&j>=0)

{

temp = a[i]-'0'+b[j]-'0'+carryIn;//计算当前位

sum[count++] = temp%10+'0';

carryIn = temp/10;//计算进位

--i;

--j;

}

if(i>=0)

{

while(i>=0)

{

temp = a[i]-'0'+carryIn;

sum[count++] = temp%10+'0';

carryIn = temp/10;

--i;

}

}

if(j>=0)

{

while(j>=0)

{

temp = b[j]-'0'+carryIn;

sum[count++] = temp%10+'0';

carryIn = temp/10;

--j;

}

}

if(carryIn>0)

{

sum[count] = '1';

}

}

void reversePrint(char arr[],int len)

{//逆向输出

for(int i=len-1;i>=0;--i)

cout<<arr[i];

cout<<endl;

}

int main()

{

string a,b;

char sum[2000];

memset(sum,'0',2000);

int nCount = 0;

int caseNum,curCase=0;

cin>>caseNum;

do

{

curCase++;

cin>>a>>b;

Add(a,b,sum,nCount);

cout<<"Case "<<curCase<<":"<<endl;

cout<<a<<" + "<<b<<" = ";

reversePrint(sum,nCount);

if(curCase<caseNum)

cout<<endl;

}while(curCase<caseNum);

return 0;

}