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