zoukankan      html  css  js  c++  java
  • ZOJ Problem Set–1494 Climbing Worm

    Time Limit: 2 Seconds      Memory Limit: 65536 KB


    An inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minute before climbing again. During the rest, it slips down d inches. The process of climbing and resting then repeats. How long before the worm climbs out of the well? We'll always count a portion of a minute as a whole minute and if the worm just reaches the top of the well at the end of its climbing, we'll assume the worm makes it out.

    Input
    There will be multiple problem instances. Each line will contain 3 positive integers n, u and d. These give the values mentioned in the paragraph above. Furthermore, you may assume d < u and n < 100. A value of n = 0 indicates end of output.

    Output
    Each input instance should generate a single integer on a line, indicating the number of minutes it takes for the worm to climb out of the well.

    Sample Input
    10 2 1
    20 3 1
    0 0 0

    Sample Output
    17
    19


    Source: East Central North America 2002

    #include<iostream>
    
    using namespace std;
    
    int main()
    
    {
    
      int n, u, d;
    
      while(cin>>n>>u>>d && n)
    
      {
    
        int upInches = 0;
    
        int minutes = 0;
    
        while(upInches < n)
    
        {
    
          minutes++;
    
          upInches += u;
    
          if(upInches >= n)
    
            break;
    
          upInches -= d;
    
          minutes++;
    
        }
    
        cout<<minutes<<endl;
    
      }
    
    }
  • 相关阅读:
    enum
    爬虫实战2:爬头条网美图--Ajax图片加载处理
    爬虫实战1:使用requests和正则爬取电影信息
    爬虫7:selenium
    爬虫6:pyquery库
    爬虫5:beautifulsoup
    爬虫4:re库
    爬虫3:requests库
    爬虫2:urllib
    爬虫1:概述
  • 原文地址:https://www.cnblogs.com/malloc/p/2425506.html
Copyright © 2011-2022 走看看