当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3988:Selecting courses

题目描述
A new Semester is coming and students are troubling for selecting courses. Students select their course on the web course system. There are n courses, the ith course is available during the time interval (Ai,Bi). That means, if you want to select the ith course, you must select it after time Ai and before time Bi. Ai and Bi are all in minutes. A student can only try to select a course every 5 minutes, but he can start trying at any time, and try as many times as he wants. For example, if you start trying to select courses at 5 minutes 21 seconds, then you can make other tries at 10 minutes 21 seconds, 15 minutes 21 seconds,20 minutes 21 seconds… and so on. A student can’t select more than one course at the same time. It may happen that no course is available when a student is making a try to select a course
You are to find the maximum number of courses that a student can select.
输入解释
There are no more than 100 test cases.
The first line of each test case contains an integer N. N is the number of courses (0 < N <= 300)
Then N lines follows. Each line contains two integers Ai and Bi (0 <= A i < Bi <=1000), meaning that the ith course is available during the time interval (Ai,Bi).
The input ends by N = 0.
输出解释
For each test case output a line containing an integer indicating the maximum number of courses that a student can select.
输入样例
2
1 10
4 5
0
输出样例
2

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-3988

最后修改于 2020-10-29T07:17:29+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 65536