hdu 1002 大数加法

A + B Problem II Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 438052    Accepted Submission(s): 85245   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 = 1111111111111111110

思路很唯一，就是用字符串存储这个大数

AC代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
int main()
{
	char op1[1002],op2[1002];
	int num[1002],num1[1002],num2[1002];
	int n,i,j,k,m;
	scanf("%d",&n);
	for(k=1;k<=n;k++)
	{
		memset(num,0,sizeof(num));
		memset(num1,0,sizeof(num1));
		memset(num2,0,sizeof(num2));
		scanf("%s%s",&op1,&op2);
		int len1=strlen(op1);
		int len2=strlen(op2);
	//	cout<<len1<<len2<<endl;
		for(i=len1-1;i>=0;i--)
		{
			num1[len1-1-i]=op1[i]-'0';
		//	cout<<num1[i];
		}
		for(i=len2-1;i>=0;i--)
		{
			num2[len2-1-i]=op2[i]-'0';
		}
		m=len1>len2?len1:len2;
	//	cout<<m<<endl;
		for(i=0;i<m;i++)
		{
			if(num1[i]+num2[i]+num[i]>=10)
			{
				num[i]=num[i]+num1[i]+num2[i]-10;
				num[i+1]++;
			}
			else num[i]+=num1[i]+num2[i];
		}
	printf("Case %d:\n",k);
	printf("%s + %s = ",op1,op2);
		for(i=m+1-1;i>0;i--)
		if(num[i]) break;
	//	cout<<i<<endl;
		for(j=i;j>=0;j--) cout<<num[j];
		cout<<endl;
		if(k!=n) cout<<endl;
	}
	return 0;
}