题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1002
题目解析:和poj1503大同小异,字符串解决;注意输出格式的要求
#include<cstdio>
#include<string>
#include<iostream>
using namespace std;
char str1[1002],str2[1002];
int a[1002],b[1002];
int c,i,j,n,m,len1,len2,cas;
int main(){
cin>>n;
for(cas=1;cas<=n;cas++){
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
cin>>str1>>str2;
len1=strlen(str1);
len2=strlen(str2);
for(i=0;i<len1;i++){
a[i]+=str1[len1-i-1]-'0';
}
for(i=0;i<len2;i++){
b[i]+=str2[len2-i-1]-'0';
}
for(i=0;i<1002;i++){
a[i]+=b[i];
if(a[i]>=10){
a[i+1]+=a[i]/10;
a[i]%=10;
}
}
cout<<"Case "<<cas<<":"<<endl;
cout<<str1<<" "<<"+"<<" "<<str2<<" "<<"="<<" ";
for(i=1001;i>=0;i--)
if(a[i])
break;
for(j=i;j>=0;j--)
cout<<a[j];
cout<<endl;
if(cas!=n)
cout<<endl;
}
return 0;
}