1122. Prerequisites?
Constraints
Time Limit: 1 secs, Memory Limit: 32 MB
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 containing1 ≤ 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 <iostream> #include <stdio.h> #include <cstring> #include <set> using namespace std; int main() { int k, m; int scourse; int c, r; int temp; while (scanf("%d", &k) && k != 0) { scanf("%d", &m); set<int> s; for (int i = 0; i < k; ++ i) { scanf("%d", &scourse); s.insert(scourse); } bool havepass = true; for (int i = 0; i < m; ++ i) { scanf("%d%d", &c, &r); int num = 0; for (int j = 0; j < c; ++ j) { scanf("%d", &temp); if (havepass == false) { continue; } if (s.count(temp)) { ++ num; } } if (num < r) { havepass = false; } } if (havepass) { printf("yes\n"); } else { printf("no\n"); } } }
相关推荐
sicily 1562_LVM.cpp参考代码
中山大学 ACM sicily 1294 题目代码
sicily 1274的AC源码,通过且速度快,适合学生使用
本程序解决了Sicily平台上Queue的问题,有较好的可读性
本程序是中山大学sicily-1137-1145-1146-1147-1154-1157-1194的代码
这是C++解题常用的模板,对参加C++机试有较大帮助
西西里全部练习输入输出以及标准程序 超高精度浮点数的输出问题 关联数组
sicily 1817和1818的程序,各有两种方法,供参考。
本程序是中山大学sicily 1004-1007-1010-1014-1021 参考代码
本程序是中山大学sicily上1200-1221-1298-1324-1325的参考代码。
包括 sicily online judge 1149等部分题目,线性表,最小生成树,中缀转后缀并计算后缀表达式等。
sicily部分源代码,全都亲测,可通过
1005. 有向图边的分类 12图算法例题1000. sicily 1155. Can I Post the letteTime Limit: 1sec Mem
中大sicily online judge的刷题指南,里面介绍得很详细,不过,最近sicily好像不能外网访问了。
sicily(soj) 1022 1064 1310 1740 1876 1934 六题的源代码(数据结构综合应用题)
本cpp是sicily的1006的解题代码 这份代码以最简单的方式实现了它的功能要求 值得学习一番
112页的大礼包,sicily的部分ac代码。
Sicily的题目分类:各种题目的分类,大致方法,以及题目难度规范
sicily1007题答案,附代码解释,可以在平台上通过