hdu1002

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <vector>
#include <stack>
#include <cstdlib>
#include <queue>
#include <set>
#include <cctype>
using namespace std;
#define  loop(i,u,v) for(int i = u;i <= v;i++)
#define rloop(i,u,v) for(int i = u;i >= v;i--)
#define eps  0.00000001

void reverse(char *a)
{
char *first = &a[0];
char *last = &a[strlen(a)-1];
for(;first < last ; first++,last--)
{
char x = *first;
*first = *last;
*last = x;
}
}

int main()
{
string a,b,c,d;
int num[1100];
int n;

cin >> n;
loop(i,1,n)
{
memset(num,0,sizeof(num));
cin >> a >> b;
c = a;
d = b;
reverse(&a[0]);
reverse(&b[0]);

int la = a.size();
int lb = b.size();
int lmin = min(la,lb);
int lmax = max(la,lb);
int x = 0;
int last = lmin - 1;
if(lb > la)
swap(a,b);

loop(j,0,last)
{
num[j] += (int)a[j] + (int)b[j] - '0' - '0';
if(num[j] >= 10)
{
num[j+1] = 1;
num[j] -= 10;
}
}
loop(j,lmin,lmax-1)
num[j] += (int)a[j] - '0';
if(num[lmax] > 9)
{
num[lmax+1] = 1;
num[lmax] -= 10;
lmax++;
}
else if(num[lmax])
lmax++;

printf("Case %d:\n",i );
printf("%s + %s = ",&c[0],&d[0] );
rloop(j,lmax-1,0)
cout << num[j];
cout << endl;
if(i < n)
cout << endl;
}

return 0;
}