|
||||||||||
Little BoxesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 10698 Accepted Submission(s): 3910 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
Sample Output
Source | ||||||||||
|