杭电poj 3619 Speed Reading

最新推荐文章于 2021-02-22 06:00:20 发布

不会敲代码的小帅

最新推荐文章于 2021-02-22 06:00:20 发布

阅读量188

点赞数

限于博主技术水平有限，若有错误请指教，若有不明白的也可以留言，博主考到必答复您，若要使用和分享还请您注明出处，谢谢。

本文链接：https://blog.csdn.net/SunPeishuai/article/details/80629459

版权

Problem X

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 19 Accepted Submission(s) : 4

Problem Description

All K (1 ≤ K ≤ 1,000) of the cows are participating in Farmer John's annual reading contest. The competition consists of reading a single book with N (1 ≤ N ≤ 100,000) pages as fast as possible while understanding it.

Cow i has a reading speed S_i (1 ≤ S_i ≤ 100) pages per minute, a maximum consecutive reading time T_i (1 ≤ T_i ≤ 100) minutes, and a minimum rest time R_i (1 ≤ R_i ≤ 100) minutes. The cow can read at a rate of S_i pages per minute, but only for T_i minutes at a time. After she stops reading to rest, she must rest for R_i minutes before commencing reading again.

Determine the number of minutes (rounded up to the nearest full minute) that it will take for each cow to read the book.

Input

* Line 1: Two space-separated integers: N and K * Lines 2..K+1: Line i+1 contains three space-separated integers: Si , Ti , and Ri

Output

* Lines 1..K: Line i should indicate how many minutes (rounded up to the nearest full minute) are required for cow i to read the whole book.

Sample Input

    10 3 2 4 1 6 1 5 3 3 3 
  

Sample Output

    6 7 7 
  

题意：一头年每分钟读s页，每连读T分钟休息R分钟，求最小多长时间读完这本书

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
    int n,m,a,b,c;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
      scanf("%d%d%d",&a,&b,&c);
      int page=n;
      int minute=0;
      while(page>(a*b))        //当连读b分钟仍然小于剩余页数
      {
          minute=minute+b+c;
          page-=a*b;
      }
      minute+=page/a;//剩余的页数
      if(page%a>0)
        minute++;
      printf("%d",minute);
    }
    return 0;
}