zoukankan      html  css  js  c++  java
  • hdu 1144

    Prerequisites?

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 634    Accepted Submission(s): 401


    Problem 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
     1 #include <iostream>
     2 #include <cstdlib>
     3 #include <cstdio>
     4 #include <cstring>
     5 
     6 using namespace std;
     7 
     8 int main(void)
     9 {
    10     int k, m;
    11 #ifndef ONLINE_JUDGE
    12     freopen("1144.in", "r", stdin);
    13 #endif
    14     int a[100+10], b[100+10];
    15     while (~scanf("%d%d", &k, &m) && k!=0)
    16     {
    17         for (int i = 0; i < k; ++i)
    18             scanf("%04d", &a[i]);
    19         int mrk = 1;
    20         for (int i = 0; i < m; ++i)
    21         {
    22             int cnt = 0;
    23             int c, r;
    24             scanf("%d%d", &c, &r);
    25             for (int j = 0; j < c; ++j)
    26             {
    27                 scanf("%d", &b[j]);
    28             }
    29             for (int j = 0; j < k; ++j)
    30             {
    31                 for (int s = 0; s < c; ++s)
    32                 {
    33                     if (b[s] == a[j])
    34                         cnt++;
    35                 }
    36             }
    37             if (cnt < r) 
    38             {
    39                 mrk = 0;
    40             }
    41         }
    42         if (mrk == 0)
    43             printf("no\n");
    44         else printf("yes\n");
    45     }
    46 
    47     return 0;
    48 }

    理解题目意思,不难……

  • 相关阅读:
    使用ConcurrentLinkedQueue惨痛的教训【转】
    非阻塞算法在并发容器中的实现【转】
    ConcurrentLinkedQueue的实现原理分析
    jQuery Validate验证框架详解
    Java中的ReentrantLock和synchronized两种锁定机制的对比
    ReentrantLock与Condition
    Java线程创建的两种方式
    JAVA并发:深入分析volatile
    Java线程同步
    JAVA jstack命令详解
  • 原文地址:https://www.cnblogs.com/liuxueyang/p/2870776.html
Copyright © 2011-2022 走看看