ZOJ3936-Apples and Ideas

最新推荐文章于 2017-08-12 18:34:00 发布

原创最新推荐文章于 2017-08-12 18:34:00 发布 · 303 阅读

0 ·

CC 4.0 BY-SA版权

----水题同时被 2 个专栏收录

234 篇文章

订阅专栏

ZOJ

120 篇文章

订阅专栏

本题描述了两个人物之间的苹果和想法的交换过程，并提供了解题思路：苹果直接交换，想法则相互分享使得双方想法数量增加。通过示例输入输出展示了具体的交换效果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

4
0 0 5 30
20 25 20 0
20 25 20 15
20 25 25 30

Sample Output

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 long
const 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;
}