Codeforces #217 (Div. 2) B. Berland Bingo

Lately, a national version of a bingo game has become very popular in Berland. There are n players playing the game, each player has a card with numbers. The numbers on each card are distinct, but distinct cards can have equal numbers. The card of the i-th player contains mi numbers.

During the game the host takes numbered balls one by one from a bag. He reads the number aloud in a high and clear voice and then puts the ball away. All participants cross out the number if it occurs on their cards. The person who crosses out all numbers from his card first, wins. If multiple people cross out all numbers from their cards at the same time, there are no winners in the game. At the beginning of the game the bag contains 100 balls numbered 1 through 100, the numbers of all balls are distinct.

You are given the cards for each player. Write a program that determines whether a player can win the game at the most favorable for him scenario or not.

Input

The first line of the input contains integer n (1 ≤ n ≤ 100) — the number of the players. Then follow n lines, each line describes a player's card. The line that describes a card starts from integer mi (1 ≤ mi ≤ 100) that shows how many numbers the i-th player's card has. Then follows a sequence of integers ai, 1, ai, 2, ..., ai, mi (1 ≤ ai, k ≤ 100) — the numbers on the i-th player's card. The numbers in the lines are separated by single spaces.

It is guaranteed that all the numbers on each card are distinct.

Output

Print n lines, the i-th line must contain word "YES" (without the quotes), if the i-th player can win, and "NO" (without the quotes) otherwise.

Sample test(s)

input

3
1 1
3 2 4 1
2 10 11

output

YES
NO
YES

input

2
1 1
1 1

output

NO
NO

题意是每次从1到100中随机叫号，判断某人是否能赢

认真读题后会发现就是一道遍历题，遍历当前行是否包含其他行的数，若是输出NO,否则输出YES

读懂题意了，但是没有能够把问题抽象出来，所用存储方式太复杂，导致三层遍历都不敢写了

看过大神的代码，以后要读完问题后不要立即敲代码，而要在纸上写出各个变量的作用，并分析题目用什么方法解决；

还要养成好的代码风格！！！

底下贴上大神的代码和我的注释：

#include <stdio.h>

int main(void)
{
    int n, i, j, k;
    int a[100][100] = {0};//用一个二维数组解决 
    scanf("%d", &n);
    for (i=0; i<n; i++)
    {
     int x;//之前我用的是数组m[i]，其实可以发现只用了一次x，完全没必要用多个变量 
     scanf("%d", &x);
     for (j=0; j<x; j++)
     {
      int y;
      scanf("%d", &y);//同上 
      a[i][y - 1] = 1;//标志y在第i行中出现过      
     }    
    }
    for (i=0; i<n; i++)
    {
     int f=0;//标识变量 
     for (j=0; j<n; j++)
     {
      if(j == i) continue;//判断除i行外其他行的情况       
      for (k=0; k<100; k++)
      {
       if (a[i][k] == 0 && a[j][k] == 1)
        break;
       //出现该情况则break掉
       //分析其对立面情况，即不会被break掉的情况：
       //a[i][k] == 1 && a[j][k] == 1说明k+1在第i、j行均出现过
       //a[i][k] == 1 && a[j][k] == 0说明k+1在第i行中出现，在第j行中未出现
       //a[i][k] == 0 && a[j][k] == 0说明k+1在第i、j行中均未出现过
       //综上可知如果第j行中的数都在第i行中出现则继续循环
       //反之说明i行肯定不包含j行    
      }
      if (k == 100) f=1;//说明i行包含当前j行中所有的数 
     }    
     if (f == 0)
      puts("YES");//说明i行不包含所有除i行以外行中的数 
     else
      puts("NO");
    }
    return 0;
}