sicily1122. Prerequisites?
来源:互联网 发布:直播淘宝小二 编辑:程序博客网 时间:2024/06/11 17:10
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 20123 9876 22222 1 8888 22223 2 9876 2222 7654 3 20123 9876 22222 2 8888 22223 2 7654 9876 22220
Sample Output
yesno
题目分析:水题一道,适用于刚学编程的人来做,选择适当的数据结构就行啦。
参考代码:
#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"); } }}
- sicily1122. Prerequisites?
- Prerequisites
- Prerequisites?
- 1122. Prerequisites?
- HDU1144 Prerequisites?
- 10919 - Prerequisites?
- poj Prerequisites?
- [caffe]prerequisites
- 1122. Prerequisites?
- Fabric Prerequisites
- SharePoint 2007 Installation Prerequisites
- sicily 1122 Prerequisites?
- zoj 2548 Prerequisites?
- Installation Prerequisites and Guidelines
- poj 2664 Prerequisites?
- HDU 1144 Prerequisites?
- POJ 2664 Prerequisites?
- hdu 1144 Prerequisites
- sicily1940. Ordering Tasks
- sicily1321. Robot
- sicily1825. Nickname
- hdu 题目4217 Data Structure?(线段树,单点更新)
- sicily1703. Obstacle Course
- sicily1122. Prerequisites?
- sicily1198. Substring
- CHM格式打不开解决方案
- sicily1155. Can I Post the lette
- sicily1625. Binary Clock
- [置顶] sicily1007. To and Fro
- sicily1010. Zipper
- CATransition用于场景转换
- C语言 南阳理工ACM 97.兄弟郊游问题