
ZOJ Problem Set  3954
A seven segment display, or seven segment indicator, is a form of electronic display device for displaying decimal numerals that is an alternative to the more complex dot matrix displays. Seven segment displays are widely used in digital clocks, electronic meters, basic calculators, and other electronic devices that display numerical information. The segments of a seven segment display are arranged as a rectangle of two vertical segments on each side with one horizontal segment on the top, middle, and bottom. If we refer the segments as the letters from a to g, it's possible to use the status of the segments which is called a seven segment code to represent a number. A standard combination of the seven segment codes is shown below.
A seven segment code of permutation p is a set of seven segment code derived from the standard code by rearranging the bits into the order indicated by p. For example, the seven segment codes of permutation "gbedcfa" which is derived from the standard code by exchanging the bits represented by "a" and "g", and by exchanging the bits represented by "c" and "e", is listed as follows.
We indicate the seven segment code of permutation p representing number x as c_{p, x}. For example c_{abcdefg,7} = 0001111, and c_{gbedcfa,7} = 1011010. Given n seven segment codes s_{1}, s_{2}, ... , s_{n} and the numbers x_{1}, x_{2}, ... , x_{n} each of them represents, can you find a permutation p, so that for all 1 ≤ i ≤ n, s_{i} = c_{p, xi} holds? InputThe first line of the input is an integer T (1 ≤ T ≤ 10^{5}), indicating the number of test cases. Then T test cases follow. The first line of each test case contains an integer n (1 ≤ n ≤ 9), indicating the number of seven segment codes. For the next n lines, the ith line contains a number x_{i} (1 ≤ x_{i} ≤ 9) and a seven segment code s_{i} (s_{i} = 7), their meanings are described above. It is guaranteed that ∀ 1 ≤ i < j ≤ n, x_{i} ≠ x_{j} holds for each test case. OutputFor each test case, output "YES" (without the quotes) if the permutation p exists. Otherwise output "NO" (without the quotes). Sample Input3 9 1 1001111 2 0010010 3 0000110 4 1001100 5 0100100 6 0100000 7 0001111 8 0000000 9 0000100 2 1 1001111 7 1010011 2 7 0101011 1 1101011 Sample OutputYES NO YES HintFor the first test case, it is a standard combination of the seven segment codes. For the second test case, we can easily discover that the permutation p does not exist, as three in seven bits are different between the seven segment codes of 1 and 7. For the third test case, p = agbfced. Author: WANG, Yucheng Source: The 17th Zhejiang University Programming Contest Sponsored by TuSimple 