시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 128 MB | 33 | 10 | 6 | 24.000% |
There is a group of N bakers in the town of Utopia. These bakers hold a monthly celebration in which they award a prize to some of the luckier among themselves. These lucky guys are chosen as follows:
In the beginning there are some chalk marks on some of the bakers' houses. Each baker has a list of his/her favorite bakers. After each celebration each of the winners puts a chalk mark on the house of all the bakers in his/her favorite list. Before each celebration those bakers with an odd number of chalk marks on their house will be chosen as winners. As there will be a great prize for the winners of the tth celebration, you are asked to find the number of its winners
The first line of the input file contains a single integer X (1 ≤ X ≤ 11), the number of test cases, followed by the input data for each test case. The input for each test case will be as follows:
There should be one line per test case. For each test case write a line containing a single integer, the number of the winners of the t-th celebration.
2 3 2 bessie 2 3 bessie linda mary mary 1 1 linda linda 0 1 bessie 2 2 siavosh 1 2 siavosh mohammad mohammad 1 0
2 0
ICPC > Regionals > Asia West Continent > Iran > Iran Internet Programming Contest > IIPC 2005 H번