A + B Problem II

package bestcoder;

import java.util.Scanner;

public class B002 {

public static void main(String[] args) {
// TODO Auto-generated method stub

Scanner scanner = new Scanner(System.in);
int cases = scanner.nextInt();
scanner.nextLine();
int[] result = new int[1010];
int count = 1;
while(count <= cases){
String lineString = scanner.nextLine();
String[] lineStrings = lineString.split(" ");
String aString = lineStrings[0];
String bString = lineStrings[1];
int p = aString.length() - 1, q = bString.length() - 1;
int index = 0, c = 0, r;
while (p >= 0 && q >= 0) {
r = (aString.charAt(p) - '0') + (bString.charAt(q) - '0') + c;
c = r / 10;
r %= 10;
result[index++] = r;
p--;
q--;
}
while(p >= 0){
r = (aString.charAt(p) - '0')  + c;
c = r / 10;
r %= 10;
result[index++] = r;
p--;
}
while (q >= 0) {
r = (bString.charAt(q) - '0') + c;
c = r / 10;
r %= 10;
result[index++] = r;
q--;
}
if (c >= 1) {
result[index++] = c;
}
StringBuffer sBuffer = new StringBuffer();

for (int i = index - 1; i >= 0; i--) {
sBuffer.append(result[i]);
}
System.out.println("Case " + count +":");
System.out.println(aString + " + "  + bString + " = " + sBuffer.toString());
if (count < cases) {
System.out.println("");
}
count++;
}
}

}