ZOJ - 2548 Prerequisites?
来源:互联网 发布:网络广播主机 编辑:程序博客网 时间:2024/05/17 06:18
Prerequisites?
Time Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %lld & %llu
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, and0 ≤ 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
University of Waterloo Local Contest 2005.09.24
分析:
水题。
ac代码:
#include <iostream>
#include<cstdio>
using namespace std;
int a[101],b[101];
int main()
{
int k,m,c,r,i,j,t;
int count,c1;
while(scanf("%d",&k)&&k)//
{
scanf("%d",&m);
for(i=0;i<k;i++)
scanf("%d",&a[i]);
c1=0;
for(i=0;i<m;i++)
{
scanf("%d%d",&c,&r);
for(j=0;j<c;j++)
scanf("%d",&b[j]);
count=0;
for(j=0;j<k;j++)
{
for(t=0;t<c;t++)
{
if(a[j]==b[t])
count++;
}
}
if(count>=r)//注意不是count==r
{
c1++;
}
}
if(c1==m)
{
printf("yes\n");
}
else
{
printf("no\n");
}
}
return 0;
}
#include<cstdio>
using namespace std;
int a[101],b[101];
int main()
{
int k,m,c,r,i,j,t;
int count,c1;
while(scanf("%d",&k)&&k)//
{
scanf("%d",&m);
for(i=0;i<k;i++)
scanf("%d",&a[i]);
c1=0;
for(i=0;i<m;i++)
{
scanf("%d%d",&c,&r);
for(j=0;j<c;j++)
scanf("%d",&b[j]);
count=0;
for(j=0;j<k;j++)
{
for(t=0;t<c;t++)
{
if(a[j]==b[t])
count++;
}
}
if(count>=r)//注意不是count==r
{
c1++;
}
}
if(c1==m)
{
printf("yes\n");
}
else
{
printf("no\n");
}
}
return 0;
}
0 0
- zoj 2548 Prerequisites?
- ZOJ - 2548 Prerequisites?
- Prerequisites
- Prerequisites?
- 1122. Prerequisites?
- HDU1144 Prerequisites?
- 10919 - Prerequisites?
- sicily1122. Prerequisites?
- poj Prerequisites?
- [caffe]prerequisites
- 1122. Prerequisites?
- Fabric Prerequisites
- SharePoint 2007 Installation Prerequisites
- sicily 1122 Prerequisites?
- Installation Prerequisites and Guidelines
- poj 2664 Prerequisites?
- HDU 1144 Prerequisites?
- POJ 2664 Prerequisites?
- bzoj2434: [Noi2011]阿狸的打字机
- hdu杭电 1113 Word Amalgamation
- Hadoop2.4.0 中Eclipse 平台的搭建
- 索罗斯重回亚洲,中美金融战争即将打响
- collection 集合实例
- ZOJ - 2548 Prerequisites?
- 暑假第1周周报
- QTP工具介绍(一)()
- [HDOJ 4501] 小明系列故事——买年货
- note 下自己,shareSDK使用
- pxe-mof exiting intel pxe rom operating system not found
- java反射机制,实例
- 49. Anagrams
- HDU 4548 美素数 // 素数筛法