A. Restoring Three Numbers
time limit per test：1 second
memory limit per test：256 megabytes
input：standard input
output：standard output
题目链接：
http://codeforces.com/problemset/problem/1154/A
原题：
Polycarp has guessed three positive integers aa, bb and cc. He keeps these numbers in secret, but he writes down four numbers on a board in arbitrary order — their pairwise sums (three numbers) and sum of all three numbers (one number). So, there are four numbers on a board in random order: a+ba+b, a+ca+c, b+cb+c and a+b+ca+b+c.
You have to guess three numbers aa, bb and cc using given numbers. Print three guessed integers in any order.
Pay attention that some given numbers aa, bb and cc can be equal (it is also possible that a=b=ca=b=c).
Input
The only line of the input contains four positive integers x1,x2,x3,x4x1,x2,x3,x4 (2≤xi≤1092≤xi≤109) — numbers written on a board in random order. It is guaranteed that the answer exists for the given number x1,x2,x3,x4x1,x2,x3,x4.
Output
Print such positive integers aa, bb and cc that four numbers written on a board are values a+ba+b, a+ca+c, b+cb+c and a+b+ca+b+c written in some order. Print aa, bb and cc in any order. If there are several answers, you can print any. It is guaranteed that the answer exists.
Examples
input
3 6 5 4
output
2 1 3
input
40 40 40 60
output
20 20 20
input
201 101 101 200
output
1 100 100
题目大意：
给你4个数字，他们顺序随机，分别是a+b,a+c,b+c,a+b+c，让你恢复原来的3个数字a、b、c，可能存在a=b=c，a、b、c都为正整数
解题思路：
由题可知a+b+c肯定是最大的数，让最大的数减去其余3个数，就得出了a、b、c的值
代码：
while True:
try:
a,b,c,d=map(int,input().split())
if a>d:
x=a
a=d
d=x
if b>d:
x=b
b=d
d=x
if c>d:
x=c
c=d
d=x
aa=d-c
bb=d-b
cc=d-a
print("{} {} {}".format(aa,bb,cc))
except:
break