← 返回题目
题库练习 [COCI-2007_2008-contest2]#1 BIJELE
← 上一题 下一题 →

A1107 | [COCI-2007_2008-contest2]#1 BIJELE

来源COCI
时间限制1s
内存限制128MB
通过 / 提交0/0

题目描述

Mirko has found an old chessboard and a set of pieces in his attic. Unfortunately, the set contains only white pieces, and apparently an incorrect number of them. A set of pieces should contain:
• One king
• One queen
• Two rooks
• Two bishops
• Two knights
• Eight pawns Mirko would like to know how many pieces of each type he should add or remove to make a valid set.

输入格式

The input consists of 6 integers on a single line, each between 0 and 10 (inclusive). The numbers are, in order, the numbers of kings, queens, rooks, bishops, knights and pawns in the set Mirko found.

输出格式

Output should consist of 6 integers on a single line; the number of pieces of each type Mirko should add or remove. If a number is positive, Mirko needs to add that many pieces. If a number is negative,
Mirko needs to remove pieces.

输入输出样例

输入 #1
0 1 2 2 2 7
输出 #1
1 0 0 0 0 1
输入 #2
2 1 2 1 2 1
输出 #2
-1 0 0 1 0 7
C++ 编辑器
输入
输出