#include<stdio.h>
#include<string.h>
#define MAX 1500
int main()
{
char s1[MAX],s2[MAX];
int a1[MAX],a2[MAX];
int T,i,j,k,n1,n2,t=1;
scanf("%d",&T);
while(T--)
{
memset(a1,0,sizeof(a1));
memset(a2,0,sizeof(a2));
scanf("%s %s",s1,s2);
n1=strlen(s1);
for(i=0,j=n1-1;i<n1;i++,j--)
a1[i]=s1[j]-'0';
n2=strlen(s2);
for(i=0,j=n2-1;i<n2;i++,j--)
a2[i]=s2[j]-'0';
for(i=0;i<MAX;i++)
{
a1[i]+=a2[i];
if(a1[i]>=10)
{
a1[i]-=10;
a1[i+1]+=1;
}
}
for(i=MAX-1;i>0;i--)
if(a1[i]!=0)break;
printf("Case %d:\n",t++);
printf("%s + %s = ",s1,s2);
for(;i>=0;i--)
printf("%d",a1[i]);
printf("\n");
if(T!=0)
printf("\n");
}
//while(1);
return 0;
}
hdoj 1002 A + B Problem II
最新推荐文章于 2023-05-04 14:45:57 发布