HDU6222Little Boxes

Little Boxes

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 86    Accepted Submission(s): 34

Problem Description

Little boxes on the hillside.
Little boxes made of ticky-tacky.
Little boxes.
Little boxes.
Little boxes all the same.
There are a green boxes, and b pink boxes.
And c blue boxes and d yellow boxes.
And they are all made out of ticky-tacky.
And they all look just the same.

 

Input

The input has several test cases. The first line contains the integer t (1 ≤ t ≤ 10) which is the total number of test cases.
For each test case, a line contains four non-negative integers a, b, c and d where a, b, c, d ≤ 2^62, indicating the numbers of green boxes, pink boxes, blue boxes and yellow boxes.

 

Output

For each test case, output a line with the total number of boxes.

 

Sample Input

  
  

   
   4
1 2 3 4
0 0 0 0
1 0 0 0
111 222 333 404
  
  

 

Sample Output

  
  

   
   10
0
1
1070
  
  
  
  

   
   题意：就是四个数相加
  
  
  
  

   
   权当练练大数的使用
  
  
  
  

   
   
import java.math.BigInteger;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner cin = new Scanner ( System.in );
        BigInteger a,b,c,d;
        int t=cin.nextInt();
        while(t>0) 
        {
            a=cin.nextBigInteger();
            b=cin.nextBigInteger();
            c=cin.nextBigInteger();
            d=cin.nextBigInteger();
            System.out.println(a.add(b.add(c.add(d))));
            t--;
        }
    }

}