还算是readable，已经比我收到的一些题面好很多了

> You are download(1 缺少ing) some things using a software (Flashget, maybe), but suddenly you have to go away for something. So, you need a program to calculate when the tasks will complete.
> 
> Now you know every download's speed、(2 英文里没顿号)size and the (12 's后面不加the)max speed. When a task is over, the bandwidth he (3 不用he)used is distributed by other tasks. The speed of one task can never go beyond the max speed of this task, and all tasks' speed can never be larger than the total bandwidth.
> 
> 
> Input
> 
> 
> There are multiple cases in the input.
> 
> The first line of one case is two integers(4 "line is integer",语感问题), n and t (n<=100). n is the number of tasks, and t is the total bandwidth. There follows n lines, one line has three integers ,means the size of the download file, the initialize(5 应该用形容词) speed and the max speed. The input promises the sum of tasks' speed equals to the total bandwidth, the speed is not larger (13 speed很少用large来形容,改成higher不错)than the max speed.
> 
> The input is terminated by a zero.
> 
> 
> Output
> For each case first print "Case %:" in one line, % is the number of case(6 可数名词必须要冠词或者复数).
> Then print n lines for n tasks, like this:
> NO*:#s
> * means the number of task, for the sequence of input; # means the finish(7 ) time of the task.
> 
> 
> 
> Hint
> 
> 
> The bandwidth will never change if no task is finish (8 finished).
> 
> When a task finished, the bandwidth is distributed follow (9 肯定不是follow)this rule:
> Every unfinished task which is not reach (10 does not reach) the max speed gets the same bandwidth; the total bandwidth can not be overflowed; every task's speed can not overflow its max speed; if there are bandwidth can be used, distribute it (11 it 不能对 are) .

• 赞每次Monthly辛勤写题面的frkstyc...大家对比一下这比赛和以往POJ Monthly的英文描述...~~~ (35) palmtenor 2007-05-05 17:14:29
• frkstyc好象修了几天假吧　？ (35) nuciedh 2007-05-05 19:53:08