[summer daily question] Luogu p6336 [coci2007-2008 2] bijele

Topic link ：P6336 [COCI2007-2008#2] BIJELE - Luogu | New ecology of computer science education (luogu.com.cn)

Background

Mirko A set of incomplete chess pieces was found in the attic .

Title Description

For the right set of chess pieces , It should contain ：

- A king ;
- A queen ;
- Two cars ;
- Two elephants ;
- Two horses ;
- Eight soldiers .

Now, how many pieces are there in this set of incomplete pieces , Please figure out how to add or delete pieces to make a complete chessboard .

Input format

Enter six numbers in a row , It means the king in turn , Queen , vehicle , like , Horse , The number of soldiers . These figures are in $0\sim 10$ Between （ Include endpoints ）.

Output format

Output six numbers in a row , It means the king in turn , Queen , vehicle , like , Horse , The number of soldiers to add or delete . Use positive numbers to add , Use negative numbers to indicate deletion .

Examples #1

The sample input #1

0 1 2 2 2 7

Sample output #1

1 0 0 0 0 1

Examples #2

The sample input #2

2 1 2 1 2 1

Sample output #2

-1 0 0 1 0 7

Tips

explain

The title is translated from  COCI2007-2008 CONTEST #2 T1 BIJELE.

AC code:

#include<iostream>
#include<algorithm>

using namespace std;

// 1 1 2 2 2 8
int main()
{
	int a[6];
	for(auto &i:a) //  Note that it must be added here  &！！！
		cin>>i;
	cout<<1-a[0]<<" "<<1-a[1]<<" "<<2-a[2]<<" "<<2-a[3]<<" "<<2-a[4]<<" "<<8-a[5];
	
	return 0;
}