ZOJ 3936-Apples and Ideas【模拟】（2016浙江省大学生程序设计竞赛）

梦里梦外; 2022-08-21 10:39 48阅读 0赞

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 andD 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 ####

5 30
    0 30
    20 25
    20 25
    20 40
    20 40
    25 55
    20 55

解题思路：

区分苹果和思维，苹果只能交换，而主意交换只能是不变或是变多。

#include<stdio.h>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    int main()
    {
    	int t;
    	scanf("%d",&t);
    	while(t--)
    	{
    		int ap,b,cp,d;
    		scanf("%d%d%d%d",&ap,&b,&cp,&d);
    		int ans;
    		ans=b+d;
    		printf("%d %d\n",cp,ans);
    		printf("%d %d\n",ap,ans);
    	}
    	return 0;
    }