|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||6||5||4||80.000%|
We shall consider sequences that meet the following conditions:
the length of the sequence is c,
the elements of the sequence are digits from the range of 1-9,
the elements are not repeated in the sequence.
A single sequence will be called a code.
When two codes are given we estimate their compatibility giving two numbers. The first one (column A in the example) is the sum of those digits that occur in both codes and appear on the same positions in both sequences, whilst the second number (column B) is the sum of those digits that occur in both codes but appear on different positions.
We are given c codes and their compatibility estimations with some unknown code. One should find and present the unknown code. Sample data and a result for c=3 are presented below.
A B codes
4 0 4 9 7
0 10 6 7 4
0 5 9 4 1
unknown code 4 1 6
Write a program which:
Your program should read the description from the standard input. In the first line there is one integer c, 1 ≤ c ≤ 9. In the following c lines there are the descriptions of the given codes of digits and the estimations of their compatibility with some unknown code, one per line. In each of the lines there are c+2 non-negative integers separated by single spaces. The first and the second number are the estimation of compatibility of the given code with the unknown one, and the last numbers are different digits from the range of 1-9 forming the given code.
Your program should write to the standard output. There should be c different digits from the range of 1-9 forming the code to be found, separated by single spaces.
You may assume that for the test data there is at least one solution. If for the input data there exist many satisfying codes, your program should write out only one of them (arbitrary).
3 4 0 4 9 7 0 10 6 7 4 0 5 9 4 1
4 1 6