水题我也不多说什么了直接附上代码,用大树来解决
import java.math.BigInteger;
import java.util.Scanner;
public class p1002 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for (int i = 1; i <= n; i++) {
BigInteger a = sc.nextBigInteger();// 用大树加法
BigInteger b = sc.nextBigInteger();
System.out.println("Case " + i + ":");
if (i < n) {
System.out.println(a + "+" + b + "=" + a.add(b));
System.out.println();
} else {
System.out.println(a + "+" + b + "=" + a.add(b));
}
}
}
}