博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
POJ 2664 Prerequisites?(我的水题之路——选课)
阅读量:4069 次
发布时间:2019-05-25

本文共 2384 字,大约阅读时间需要 7 分钟。

Prerequisites?
Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 3063   Accepted: 1931

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 20123 9876 22222 1 8888 22223 2 9876 2222 7654 3 20123 9876 22222 2 8888 22223 2 7654 9876 22220

Sample Output

yesno

Source

每一个人毕业需要选课,他已经选了k门课程,现在该专业有m个课程类别,每个类别有c个课程,最少需要选择r门课程才可以毕业,以及该类别下课程的号码列表。如果每个类别,均已经选择了至少r门课程,则可以毕业输出“yes”,否则输出“no”。
将已经选择的课程标记下来,然后对于每一个类别分别进行验证是否已经符合了要求。
注意点:
1)每一个类别要分开统计是否达标,不能混淆(1WA)。
代码(1AC 1WA):
#include 
#include
#include
int arr[10010];int main(void){ int k, c; int num, need, tmp, taken; int flag; int i, j; while (scanf("%d", &k), k != 0){ memset(arr, 0, sizeof(arr)); scanf("%d", &c); for (i = 0; i < k; i++){ scanf("%d", &tmp); arr[tmp] = 1; } flag = 1; for (i = 0; i < c; i++){ scanf("%d%d", &num, &need); for (j = taken = 0; j < num; j++){ scanf("%d", &tmp); if (arr[tmp] == 1){ taken ++; } } if (taken < need){ flag = 0; } } if (flag){ printf("yes\n"); } else{ printf("no\n"); } } return 0;}

转载地址:http://wloji.baihongyu.com/

你可能感兴趣的文章
rpmbuild 使用笔记
查看>>
openstack 管理三十九 - 通过修改数据库方法实现 VM 迁移
查看>>
shell 限制用户输入条件
查看>>
利用 PHP 查询 ZABBIX API 信息, 获得主机当前使用率
查看>>
正则匹配
查看>>
RHEL6 磁盘永久性命名方法
查看>>
xcache 安装备忘
查看>>
sysbench RHEL6 安装备忘
查看>>
rhel6 kvm 备忘
查看>>
shell 数组备忘
查看>>
megacli 管理 ceph 存储常用脚本
查看>>
mysql 架构备忘
查看>>
bwm-tools compile error resolve.
查看>>
office
查看>>
ansible - 1 安装与准备
查看>>
mysql - galera 故障恢复
查看>>
ansible - 2 playbook 结构说明
查看>>
MySQL 锁
查看>>
bonding mode 4 测试
查看>>
ceph - 故障测试 [目标: 延时自动执行 RECOVERY]
查看>>