UVA 10919

UVA 10919

题目介绍:
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?

大意:
简单的判断学的课程够没够,用set即可

AC代码:

#include<iostream>
#include<cstring>
#include<set>
using namespace std;

int main(){
	int n,k;
	while(scanf("%d",&n)&&n){
		scanf("%d",&k);
		set<string> study;
		for(int i=0;i<n;i++){
			string s;
			cin>>s;
			study.insert(s);
		}
		int ok=0;
		for(int i=0;i<k;i++){
			int r,c;
			scanf("%d%d",&r,&c);
			int num=0;
			for(int j=0;j<r;j++){
				string s;
				cin>>s;
				if(study.count(s))num++;
			}
			if(num<c)ok=1;
		}
		printf("%s\n", ok==0 ? "yes" : "no");
	}
	return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值