HDU 1002

用到了大整数的知识；其实就是两个整型数组的加法；

#include<iostream>
#include<string.h>
using namespace std;

int main()
{
	int n;
	cin>>n;
	int k=1;
	while(n--)
	{
		string s1,s2;
		cin>>s1>>s2;
		int j=0;
		if(k-1!=0) cout<<endl;
		cout<<"Case "<<k++<<":"<<endl;
		cout<<s1<<" + "<<s2<<" = ";
		int arr1[1000],arr2[1000],arr[1000];
		memset(arr1,0,sizeof(arr1));
		memset(arr2,0,sizeof(arr2));
		memset(arr,0,sizeof(arr));
		for(int i=0;i<s1.length();i++)
		  arr1[i]=s1[s1.length()-i-1]-'0';
		for(int j=0;j<s2.length();j++)
		  arr2[j]=s2[s2.length()-j-1]-'0';
		int len=(s1.length()>s2.length())?s1.length():s2.length();
		for(int z=0;z<len;z++)
		{
			int t=(arr1[z]+arr2[z]+j);
			arr[z]=t%10;
			j=t/10;
		}
		if(j!=0)
		{
			arr[len++]=j;
		}   
		for(int i=0;i<len;i++)
		  cout<<arr[len-i-1];
		cout<<endl;  
	} 
	return 0;
}