原文链接:http://www.cnblogs.com/cattree/p/7497208.html
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
char a[1004],b[1004];
int aa[1004],bb[1004];
int main()
{
int t;
scanf("%d",&t);
int flag=0;
while(t--)
{
flag++;
printf("Case %d:\n",flag);
cin>>a>>b;
memset(aa,0,sizeof(aa));
memset(bb,0,sizeof(bb));
for(int i=strlen(a)-1,k=0;i>=0;i--,k++)
{
aa[k]=a[i]-'0';
}
for(int i=strlen(b)-1,k=0;i>=0;i--,k++)
{
bb[k]=b[i]-'0';
}
int max=strlen(a)>strlen(b)?strlen(a):strlen(b);
for(int i=0;i<max;i++)
{
aa[i+1]=aa[i+1]+(aa[i]+bb[i])/10;
aa[i]=(aa[i]+bb[i])%10;
}
printf("%s + %s = ",a,b);
int str=aa[max]>0?max:max-1;
for(int i=str;i>=0;i--)
{
printf("%d",aa[i]);
}
printf("\n");
if(t!=0)
printf("\n");
}
return 0;
}