33 人解决，34 人已尝试。
35 份提交通过，共有 67 份提交。
3.2 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
Anna, Betty, Cindy and Zelda like playing the card game Euchre. Euchre is a game for two teams of two, and each time they meet the girls split off into different teams. They also keep overall records of the number of games each player has won and lost. Anna has misplaced her won-loss results, but she does have the results of the other three players. Given this, she figures she can determine her won-loss record.
Input will consist of multiple problem instances. Each instance will consist of a single line containing six integers. The first two are the number of wins and losses (respectively) for Betty, the next two are the number of wins and losses for Cindy and the last two are the number of wins and losses for Zelda. A final line of six zeroes will terminate input and should not be processed.
For each problem instance, output a single line indicating Anna’s won-loss record, in the format shown in the example below.
10 3 6 7 8 5 1874 2945 2030 2789 1025 3794 0 0 0 0 0 0
Anna's won-loss record is 2-11. Anna's won-loss record is 4709-110.
33 人解决，34 人已尝试。
35 份提交通过，共有 67 份提交。
3.2 EMB 奖励。