2 1 2 112233445566778899 998877665544332211
Case 1: 1 + 2 = 3 Case 2: 112233445566778899 + 998877665544332211 = 1111111111111111110
#include <stdio.h>
#include <string>
int main(int argc, char* argv[])
{
int n, i;
scanf("%d", &n);
char** a = new char* [n];
char** b = new char* [n];
char** r = new char* [n];
for (i = 0; i < n; ++i)
{
a[i] = new char [1000];
b[i] = new char [1000];
r[i] = new char [1000];
memset(r[i], 0 , sizeof(char)*1000);
}
for (i = 0; i < n; ++i)
{
scanf("%s", a[i]);
scanf("%s", b[i]);
}
for (i = 0; i < n; ++i)
{
printf("Case %d:/n", i+1);
int aSize = strlen(a[i]);
int bSize = strlen(b[i]);
int k = 0, v = 0, u = 0, j;
while (true)
{
if (aSize <= 0 && bSize <= 0)
{
if (u>0)
r[i][k++] = u+'0';
break;
}
else if (aSize <= 0)
{
v = b[i][bSize-1]-'0'+u;
u = v>9?v/10:0;
v = v>9?v%10:v;
r[i][k++] = v+'0';
--bSize;
}
else if (bSize <= 0)
{
v = a[i][aSize-1]-'0'+u;
u = v>9?v/10:0;
v = v>9?v%10:v;
r[i][k++] = v+'0';
--aSize;
}
else
{
v = a[i][aSize-1]-'0'+b[i][bSize-1]-'0'+u;
u = v>9?v/10:0;
v = v>9?v%10:v;
r[i][k++] = v+'0';
--aSize;
--bSize;
}
}
for (j = 0; j < k/2; ++j)
{
char tmp = r[i][j];
r[i][j] = r[i][k-j-1];
r[i][k-j-1] = tmp;
}
if (i == n-1)
printf("%s + %s = %s/n", a[i], b[i], r[i]);
else
printf("%s + %s = %s/n/n", a[i], b[i], r[i]);
}
delete [] a;
delete [] b;
delete [] r;
return 0;
}