杭电oj-A + B Problem II

Problem Description

I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.

Input

The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line consists of two positive integers, A and B. Notice that the integers are very large, that means you should not process them by using 32-bit integer. You may assume the length of each integer will not exceed 1000.

Output

For each test case, you should output two lines. The first line is “Case #:”, # means the number of the test case. The second line is the an equation “A + B = Sum”, Sum means the result of A + B. Note there are some spaces int the equation. Output a blank line between two test cases.

Sample Input

2
1 2
112233445566778899 998877665544332211

Sample Output

Case 1:
1 + 2 = 3

Case 2:
112233445566778899 + 998877665544332211 = 1111111111111111110

solution

大数加法

注意事项

1.要注意边界问题，比如0+0=0，9999+999999999这种
2.要注意符合题目要求：最后一次输出不需要换行，Case第一个字母要大写

代码

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        for(int i = 1;i <= n; i++){
            String n1 = new StringBuffer(sc.next()).reverse().toString();
            String n2 = new StringBuffer(sc.next()).reverse().toString();
            int length_max = n1.length() > n2.length()? n1.length()+1: n2.length()+1;
            int[] result = new int[length_max];
            int[] int_n1 = new int[length_max];
            int[] int_n2 = new int[length_max];

            for (int f = 0; f < n2.length(); f++) {
                int_n2[f] = Integer.parseInt(String.valueOf(n2.charAt(f)));
            }
            for (int f = 0; f < n1.length(); f++) {
                int_n1[f] = Integer.parseInt(String.valueOf(n1.charAt(f)));
            }
            for( int j = 0; j < length_max - 1; j++){
                int a = result[j] + int_n1[j] + int_n2[j];
                result[j] = a % 10;
                result[j+1] += a / 10;
            }
            System.out.println("Case "+i+":");
            System.out.print(new StringBuffer(n1).reverse().toString() + " + " + new StringBuffer(n2).reverse().toString() + " = ");
            int flag = 0;
            if(n1.length() == 1 && n2.length() == 1 && int_n1[n1.length()-1] == 0 && int_n2[n2.length()-1] == 0){
                System.out.print("0");
            }else {
                for(int j = result.length - 1; j>=0; j--){
                    if(result[j] != 0 || flag != 0){
                        System.out.print(result[j]);
                        flag = 1;
                    }
                }
            }
            System.out.println();
            if(i < n){
                System.out.println();
            }
        }
    }
}