Time Limit: 2000/1000 MS
(Java/Others) Memory Limit: 65536/32768 K
(Java/Others)
Total Submission(s): 199099 Accepted
Submission(s): 38099
#include<stdio.h>
#include<iostream>
#include<string.h>
using
namespace std;
int sum[111111];
int main()
{
int t,j=0;
int i,lenmax=0,lenmin=0,jw=0,xh=0,a=0;
cin>>t;
for(j=0;
j<t; j++)
{
string s1,s2,c1,c2;
memset(sum,0,sizeof(sum));
cin>>s1>>s2;
c1=s1,c2=s2;
if(s1.size()<s2.size())swap(s1,s2);
lenmax
= s1.size()-1;
lenmin = s2.size()-1;
jw = lenmax;
xh = lenmin;
for(i=0; i<xh+1; i++)
{
sum[i] = s1[lenmax--]+s2[lenmin--]-‘0‘-‘0‘;
}
for(int pp =
i;pp < jw+1;pp ++) sum[pp] = s1[lenmax--]-‘0‘;
for(i=0 ; i<=jw
; i++)
{
if(sum[i]>9)
{
if(i==jw)a++;
sum[i]=sum[i]-10;
sum[i+1]++;
}
}
cout<<"Case
"<<j+1<< ":" << endl;
cout<<c1<<" +
"<<c2<<" = ";
for(i = jw+a; i>=0; i--)
{
cout<<sum[i];
}
cout<<endl;
i=0;lenmax = 0;lenmin = 0;jw = 0;a = 0;xh = 0;
if(j < t-1)puts("");
}
return 0;
}
原文地址:http://www.cnblogs.com/Duskcl/p/3700379.html