锘??xml version="1.0" encoding="utf-8" standalone="yes"?>
Total Submission(s): 14324 Accepted Submission(s): 2486
2
1 2
112233445566778899 998877665544332211
Case 1:
1 + 2 = 3
Case 2:
112233445566778899 + 998877665544332211 = 1111111111111111110
#include<cstring>
using namespace std;
char *add(char *a,char *b)
{
int i,j,k=0;
int temp[1001];
int length1 = strlen(a);
int length2 = strlen(b);
for(i = length1-1, j = length2 -1 ; i >= 0&&j >= 0; --i,--j)
temp[k++] = a[i] + b[j] - '0' - '0';
for(;i >= 0; --i)
temp[k++] = a[i] - '0';
for(;j >= 0; --j)
temp[k++] = b[j] - '0';
temp[k] = 0;
for(i = 0;i < k; ++i)
{
temp[i+1] += temp[i] / 10;
temp[i] %=10;
}
if(!temp[k]) k--;
for(i = 0;i <= k;i++)
a[i] = temp[k-i] + '0';
a[k+1] = '\0';
return a;
}
int main()
{
char a[1001],b[1001],*r;
int number = 0;
int k = 1;
cin >> number;
while(number--)
{
if(cin >> a >> b)
{
cout << "Case "<< k++ << ":\n" << a << " + " << b <<" = ";
r = add(a,b);
cout << r;
cout << endl;
if(number)
cout<<endl;
}
}
return 0;
}
]]>