[BOJ 7891] Can you add this?

View as PDF

Submit solution

Points: 1
Time limit: 1.0s
Memory limit: 128M

Problem types
Allowed languages
Assembly, Awk, C, C++, Java, Pascal, Perl, Python, Sed, Text

Given two integers, calculate and output their sum.

입력 형식

The input contains several test cases. The first line contains and integer t (t ≤ 100) denoting the number of test cases. Then t tests follow, each of them consisiting of two space separated integers x and y (−109 ≤ x, y ≤ 109).

출력 형식

For each test case output output the sum of the corresponding integers.

예제 입력

4
-100 100
2 3
0 110101
-1000000000 1

예제 출력

0
5
110101
-999999999

Comments

There are no comments at the moment.