ACMSTEP 2.3.1 A+B Problem II //大数加法

原题地址

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
void add(char *str1, char *str2, char *str3)
{
	int i, j, i1, i2, tmp, carry;
	int len1 = strlen(str1), len2 = strlen(str2);
	char ch;
	
	i1 = len1 - 1; i2 = len2 - 1;
	j = carry = 0;
	for (; i1>=0 && i2>=0; ++j, --i1, --i2)
	{
		tmp = str1[i1] -'0' + str2[i2]-'0'+ carry;
		carry = tmp/ 10;
		str3[j] = tmp % 10 +'0';
	}
	while (i1 >=0)
	{
		tmp = str1[i1--]-'0'+carry;
		carry = tmp / 10;
		str3[j++] = tmp %10 +'0';
	}
	while (i2 >= 0)
	{
		tmp = str2[i2--]-'0'+carry;
		carry = tmp / 10;
		str3[j++] = tmp % 10 +'0';
	}
	if (carry) str3[j++] = carry +'0';
	str3[j] = '\0';
	
	for (i=0 , --j; i<j; ++i, --j)
	{
		ch = str3[i];str3[i] = str3[j]; str3[j]=ch;
	}
}

using namespace std;
int main()
{
	char sa[1005],sb[1005],sc[1005];
	int cases, i;
	cin>>cases;
	for(i=1; i<=cases; i++)
	{
		if (i!=1) cout<<endl;
		cin>>sa>>sb;
		memset(sc,0,sizeof(sc));
		add(sa,sb,sc);
		cout<<"Case "<<i<<":"<<endl;
		cout<<sa<<" + "<<sb<<" = "<<sc<<endl;
	}
	return 0;
}