URAL 2001. Mathematicians and Berries

2001. Mathematicians and Berries

Time limit: 0.5 second
Memory limit: 64 MB

One day, two mathematicians were walking in the forest and picking berries. They’d been walking for two hours, and then they stopped and decided to see who’s got more berries. They took out the scales (can you imagine a mathematician going to the forest without any scales?) and they weighed their baskets with berries. They wrote the resulting numbers a1 and b1 down on a piece of paper. Then the second mathematician put all his berries to the first one’s basket (so that his basket became completely empty) and they weighed their baskets again and they received numbers a2 and b2, correspondingly. At last, the first mathematician put all the berries to the second one’s basket (so that his basket became completely empty); they weighed the baskets and got numbers a3 and b3, correspondingly. This data was enough to find the winner and the happy mathematicians moved on. Your task is to calculate the mass of the berries in each mathematician’s basket by the start of the competition.

Input

The input data consists of three lines. The i’th line (1 ≤ i ≤ 3) contains integers ai and bi (0 ≤ ai, bi ≤ 10 000).

Output

Output the weight of berries in the basket of the first and the second mathematician correspondingly.

Sample

inputoutput

1 22 10 3

1 1

第一组数据全部是总重，第二三组就分别有筐重，找对数据做差就能算出净重了，灰常简单~

#include<cstdio>#include<iostream>using namespace std;int a[10];int main(){    int j=0;    for(int i=0;i<3;i++)    {        cin>>a[j++];        cin>>a[j++];    }    cout<<a[0]-a[4]<<" "<<a[1]-a[3]<<endl;    return 0;}