zoj 1715 When Can We Meet?
来源:互联网 发布:alphago软件下载 编辑:程序博客网 时间:2024/05/04 22:29
水题。。。
在找出最多个会议成员空闲的公共时间相同的情况下输出最早的时间
#include<stdio.h>int main(){int n,q,m,i,num[105],x,max;while(scanf("%d%d",&n,&q)!=EOF){if(n==0&&q==0)break;for(i=0;i<105;i++)num[i]=0;while(n--){scanf("%d",&m);while(m--){scanf("%d",&x);num[x]++;}}max=0;for(i=1;i<105;i++)if(num[i]>=q){if(num[max]<num[i])max=i;}printf("%d\n",max);}return 0;}
- ZOJ 1715 When Can We Meet?
- zoj 1715 When Can We Meet?
- ZOJ 1715 When Can We Meet?
- 1715 When Can We Meet?
- zoj 1715 When Can We Meet?(水~)
- zoj 1751 When Can We Meet?
- 2028 When Can We Meet?
- (简单)When Can We meet?
- zoj1715---------------------When Can We Meet?
- poj2028 When Can We Meet?
- poj2028 When Can We Meet?
- POJ2028 When Can We Meet?
- POJ2028 When Can We Meet? 水题
- 北大ACM poj2028 When Can We Meet?
- POJ 2028 When can we meet?
- poj 2028 When Can We Meet?
- POJ2028——When Can We Meet?
- POJ 2028 When Can We Meet? 枚举
- 隐蔽的内存泄漏——pthread_create 属性设置不当导致
- 《远控编程笔记》 第五天
- Geoserver & Openlayers 学习笔记
- Cocos2d-x 2.0 粒子系统深入分析三部曲(三)
- 数组元素交叉排列的算法题(a1 a2 a3 .. an b1 b2 b3 .. bn -->a 1 b1, a2 b2, a3 b3, .. an bn )
- zoj 1715 When Can We Meet?
- 【转】每天工作4小时的程序员
- 总有一天你将破蛹而出
- 简单的排序---选择排序
- hdu - 2054 - A == B ?
- FFmpeg在编译安装的时候,始终不能启动flashsv编码器
- vim 高级语法
- IBM的LPI复习资料之LPI101-Topic101:系统体系结构(2)Runlevels, shutdown, and reboot
- cocos2D-x初探学习笔记(32)-cocos2d-x & javascript跨平台初体验