HDOJ——1002 A + B Problem II
A + B Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 432906 Accepted Submission(s): 84279Problem 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 Author Ignatius.L |
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc= new Scanner(System.in); int n=sc.nextInt(); int flag=0; for(int i=0;i<n;i++) { int t=i+1; String a; String b; int[] c,d; a=sc.next(); b=sc.next(); int alength=a.length(); int blength=b.length(); int l,m; if(alength>blength) { l=alength; m=blength; c=new int[l+1]; d=new int[m]; for(int j=l-1,k=0;j>=0;j--,k++) { c[k]=a.charAt(j)-48; } for(int j=m-1,k=0;j>=0;j--,k++) { d[k]=b.charAt(j)-48; } } else { l=blength; m=alength; c=new int[l+1]; d=new int[m]; for(int j=l-1,k=0;j>=0;j--,k++) { c[k]=b.charAt(j)-48; } for(int j=m-1,k=0;j>=0;j--,k++) { d[k]=a.charAt(j)-48; } } for(int j=0,k=0;j<l&&k<m;j++,k++) { if(c[j]+d[k]>=10) { c[j]=c[j]+d[k]-10; if(j<l) c[j+1]++; else { c[j+1]=1; flag=1; } } else { c[j]=c[j]+d[k]; } } if(t!=1) System.out.println(); System.out.println("Case "+t+":"); System.out.print(a+" + "+b+" = "); if(flag==1) for(int j=c.length-1;j>=0;j--) { System.out.print(c[j]); } else for(int j=c.length-2;j>=0;j--) { System.out.print(c[j]); } System.out.println(); } } }