zoukankan      html  css  js  c++  java
  • 水题 hdu1002------用BigInteger解决大数问题

    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
     
     
     
     
    import java.util.*;
    import java.math.*;
    
    public class Main3 {
    
    	public static void main(String[] args) {
    		Scanner sc=new Scanner(System.in);
    		
    		int t=Integer.parseInt(sc.next());
    		for(int i=0;i<t;i++){
    			BigInteger a=new BigInteger(sc.next());
    			BigInteger b=new BigInteger(sc.next());
    			BigInteger c=a.add(b);
    			System.out.println("Case "+(i+1)+":");
    			System.out.println(a+" "+"+"+" "+b+" "+"="+" "+c);
    			if(i!=t-1)
    			System.out.println();
    		}
    		
    	}
    
    }
    

  • 相关阅读:
    HDU 1941 Justice League
    HDU 1960 Taxi Cab Scheme
    POJ 1986 Distance Queries
    UVA 11991 Easy Problem from Rujia Liu?
    sql的跟踪与Tkprof工具
    ORA04031 错误
    Oracle_spatial的空间索引
    oracle发生重启动的介绍
    expdp\impdp及exp\imp
    oracle锁
  • 原文地址:https://www.cnblogs.com/oversea201405/p/3752284.html
Copyright © 2011-2022 走看看