ZOJ 3936Apples and Ideas

Apples and Ideas

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

"If you have an apple and I have an apple and we exchange these apples then you and I will still each have one apple. But if you have an idea and I have an idea and we exchange these ideas, then each of us will have two ideas." - George Bernard Shaw

Now Alice has A apples and B ideas, while Bob has C apples and D ideas, what will they have if they exchange all things?

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The only line contains four integers A, B, C, D (0 <= A, B, C, D <= 100) - as the problem described.

Output

For each test case, output two lines. First line contains two integers, indicating the number of Alice's apples and ideas; second line contains two integers, indicating the number of Bob's apples and ideas.

Sample Input

40 0 5 3020 25 20 020 25 20 1520 25 25 30

Sample Output

5 300 3020 2520 2520 4020 4025 5520 55

---

Author: DAI, Longao

Source: The 13th Zhejiang Provincial Collegiate Programming Contest

省赛第一道，大水题，两分钟一A

#include<cstdio>#include<algorithm>using namespace std;typedef long long LL;const int maxn = 1e5 + 4;int T, a, b, c, d;int main(){scanf("%d", &T);while (T--){scanf("%d%d%d%d", &a, &b, &c, &d);printf("%d %d\n%d %d\n", c, b + d, a, b + d);}return 0;}