hdu1002 A + B Problem II

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1205;
int a[maxn],b[maxn];
int c[maxn];
int main(void)
{
int t,case_t = 1;
scanf("%d",&t);
while(t--)
{
if(case_t!=1)
puts("");
string t1,t2;
cin>>t1>>t2;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
a[0] = t1.length(),b[0] = t2.length();
for(int i=1;i<=a[0];i++)
a[i] = t1[a[0]-i] - '0';
for(int i=1;i<=b[0];i++)
b[i] = t2[b[0]-i] - '0';
int lenc = 1,x = 0;
while(lenc <= a[0] || lenc <= b[0])
{
c[lenc] = b[lenc]+a[lenc]+x;
x = c[lenc]/10;
c[lenc] %= 10;
lenc++;
}
c[lenc]=x;
while(c[lenc]==0 && lenc>1)
lenc--;
printf("Case %d:\n",case_t++);
cout<<t1<<" + "<<t2<<" = ";
for(int i=lenc;i>=1;i--)
printf("%d",c[i]);
puts("");

}
return 0;
}
/*
000 0000
9999 1
1 9999
99900 00999
*/

import java.math.BigInteger;
import java.util.Scanner;

public class Main{

public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int n = cin.nextInt();
for(int i=1;i<=n;i++)
{
BigInteger a = cin.nextBigInteger();
BigInteger b = cin.nextBigInteger();
BigInteger ans = a.add(b);
System.out.println("Case " + i + ":");
System.out.print(a + " + " + b + " = ");
System.out.println(ans);
if(i!=n)
System.out.println("");
}
cin.close();
}

}