杭电ACM HDU 3105 Fred's Lotto Tickets

Fred's Lotto Tickets

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 530    Accepted Submission(s): 352

Problem Description

Fred likes to play the lotto. Whenever he does, he buys lots of tickets. Each ticket has 6 unique numbers in the range from 1 to 49, inclusive. Fred likes to ``Cover all his bases." By that, he means that he likes for each set of lottery tickets to contain every number from 1 to 49, at least once, on some ticket. Write a program to help Fred see of his tickets ``Cover all the bases."

 

Input

The input file consists of a number of test cases. Each case starts with an integer N ( 1<=N<=100 ), indicating the number of tickets Fred has purchased. On the next N lines are the tickets, one per line. Each ticket will have exactly 6 integers, and all of them will be in the range from 1 to 49 inclusive. No ticket will have duplicate numbers, but the numbers on a ticket may appear in any order. The input ends with a line containing only a `0'.

 

Output

Print a list of responses for the input sets, one per line. Print the word `Yes' if every number from 1 to 49 inclusive appears in some lottery ticket in the set, and `No' otherwise. Print these words exactly as they are shown. Do not print any blank lines between outputs.

 

Sample Input

11 2 3 4 5 691 2 3 4 5 610 9 8 7 12 1113 14 15 16 17 1819 20 21 22 23 2425 26 27 28 29 3031 32 33 34 35 3637 38 39 40 41 4243 44 45 46 47 4849 19 34 27 25 130

 

Sample Output

NoYes

 

Source

2008 ACM-ICPC Southeast USA Regional

 

Recommend

gaojie

 

 

#include <stdio.h>int main(){    int n,i,a;    int f[50];    while(scanf("%d",&n),n){        for(i=0;i<50;i++)            f[i]=0;        for(i=0;i<n*6;i++){            scanf("%d",&a);            f[a]=1;        }        for(i=1;i<50;i++)            if(f[i]==0)i=60;        printf("%s\n",i>55?"No":"Yes");    }}