ZOJ3936-Apples 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

题意：告诉你两个人拥有的苹果和idea，问交换后苹果和idea数量
解题思路：苹果交换，idea互相求和

#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <cmath>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;int main(){int t;scanf("%d", &t);while (n--){int a, b, c, d;scanf("%d%d%d%d", &a, &b, &c, &d);swap(a, c);b = d = b + d;printf("%d %d\n%d %d\n", a, b, c, d);}return 0;}