zoukankan      html  css  js  c++  java
  • 2664 Prerequisites?

    Prerequisites?
    Time Limit: 2000MS Memory Limit: 65536K
    Total Submissions:4002 Accepted: 2510

    Description

    Freddie the frosh has chosen to take k courses. To meet the degree requirements, he must take courses from each of several categories. Can you assure Freddie that he will graduate, based on his course selection?

    Input

    Input consists of several test cases. For each case, the first line of input contains 1 <= k <= 100, the number of courses Freddie has chosen, and 0 <= m <= 100, the number of categories. One or more lines follow containing k 4-digit integers follow; each is the number of a course selected by Freddie. Each category is represented by a line containing 1 <= c <= 100, the number of courses in the category, 0 <= r <= c, the minimum number of courses from the category that must be taken, and the c course numbers in the category. Each course number is a 4-digit integer. The same course may fulfil several category requirements. Freddie's selections, and the course numbers in any particular category, are distinct. A line containing 0 follows the last test case.

    Output

    For each test case, output a line containing "yes" if Freddie's course selection meets the degree requirements; otherwise output "no".

    Sample Input

    3 2
    0123 9876 2222
    2 1 8888 2222
    3 2 9876 2222 7654 
    3 2
    0123 9876 2222
    2 2 8888 2222
    3 2 7654 9876 2222
    0
    

    Sample Output

    yes
    no

    #include<stdio.h>
    #include<stdlib.h>
    #define Max 101
    int main()
    {
    	int k,m,c,r;
    	int i,j;
    	int count,flag;
        int take[Max];
        int select[Max];
        while(1)
        {   
        	flag=0;
            scanf("%d",&k);
            if(k==0)break;
            scanf("%d",&m);
            for(i=0;i<k;i++)scanf("%d",&take[i]);
            while(m--)
            {   
            	count=0;
            	scanf("%d%d",&r,&c);
            	for(i=0;i<r;i++)
            		scanf("%d",&select[i]);
            	for(i=0;i<k;i++)
            		for(j=0;j<r;j++)
            		{
            			if(take[i]==select[j])
            				count++;
            		}
            		if(count<c)flag=1;
            }
            if(flag)printf("no
    ");
            else printf("yes
    ");
    
        }
        return 0;
    }

  • 相关阅读:
    定位,标记,Socket通信传输位置
    多维数组的下标存取
    ufunc函数
    八大排序算法
    揭开Python科学计算的面纱
    【python51--__name__属性】
    【Python48--魔法方法:迭代器&生成器】
    【Python047-魔法方法:定制序列】
    【MonkeyRunner环境搭建】
    【Python046--魔法方法:描述符】
  • 原文地址:https://www.cnblogs.com/kuroko-ghh/p/9363351.html
Copyright © 2011-2022 走看看