当前位置：首页 > 算法设计(3)
算法分析与设计实验报告
学院：
专业：
学号：姓名：
目录
一、 实验要求
二、 实验内容与思想设计
三、 测试结果
四、 实验心得
五、 附 ：源程序
一、实验要求
实验一
活动安排问题
问题描述：
有n(n<=100)个活动，每个活动都要求使用同一会场，而在同一时间内只有一个活动能使用这一会场。每个活动i都有一个要求使用该资源的起始时间si和一个结束时间fi,且si
数据输入：
每行2个整数（10000以内），用空格间隔。表示每个活动的起始和结束时间。最后一行是2个0，表示所有输入的结束。
结果输出:
一个整数，表示最多能安排几个活动。
Sample Input
1 2 1 4 1 3 2 3 0 0
Sample Output 2
实验二
FatMouse' Trade
问题描述：
FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.
The warehouse has N rooms. The i-th room contains J[i] pounds of JavaBeans and requires F[i] pounds of cat food. FatMouse does not have to trade for all the JavaBeans in the room, instead, he may get J[i]* a% pounds of JavaBeans if he pays F[i]* a% pounds of cat food. Here a is a real number. Now he is assigning this homework to you: tell him the maximum amount of JavaBeans he can obtain.
数据输入：
The input consists of multiple test cases. Each test case begins with a line containing two non-negative integers M and N. Then N lines follow, each contains two non-negative integers J[i] and F[i] respectively. The last test case is followed by two -1's. All integers are not greater than 1000.
结果输出:
For each test case, print in a single line a real number accurate up to 3 decimal places, which is the maximum amount of JavaBeans that FatMouse can obtain.
Sample Input 5 3 7 2 4 3 5 2
20 3 25 18 24 15 15 10 -1 -1 Sample Output
本文作者：...共分享92篇相关文档
