hdoj 1002 A + B Problem II 高精度 java

標籤：

A + B Problem II

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 241933    Accepted Submission(s): 46646

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

 

InputThe 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. 

 

OutputFor 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 Input21 2112233445566778899 998877665544332211 

 

Sample OutputCase 1:1 + 2 = 3Case 2:112233445566778899 + 998877665544332211 = 1111111111111111110   題意：高精度a+b   題解java大法好！ 

import java.util.*;   import java.io.*;   import java.math.*;     public class Main{       public static void main(String[] args) {           Scanner in = new Scanner(System.in);        int t=in.nextInt();        for(int i=1;i<=t;i++)        {            if(i!=1)                System.out.println();            BigInteger a = in.nextBigInteger();            BigInteger b = in.nextBigInteger();            System.out.println("Case "+i+":");            System.out.println(a+" + "+b+" = "+a.add(b));        }    }   }  

 

  

hdoj 1002 A + B Problem II 高精度 java