zoukankan      html  css  js  c++  java
  • 小虫爬井

    Problem Description

    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

    #include<stdio.h>
    int main()
    {
        int n, u, d, t;
        int i = 0, j = 0, k;
        while( scanf( "%d%d%d" , &n, &u, &d ) == 3)
        {
              t = 0;
              i = 0;
              if( n == 0 && u == 0 && d == 0 )
                       break;
               while( 1 )
               {
                    i += u ;
                    if( i >= n )
                    {
                      t++;
                      break;
                      }
                    i -= d;
                    t += 2;
        
               }
           printf( "%d\n", t );
                
        }
    }

  • 相关阅读:
    HDU3746 Cyclic Nacklace KMP
    KMP的小结
    POJ1916 Period KMP
    POJ 2406 Power Strings 简单KMP模板 strcmp
    HDU 2157 How many ways?? (邻接矩阵快速幂)
    (VIJOS) VOJ 1067 Warcraft III 守望者的烦恼 矩阵快速幂
    puppet之自定义fact(转载)
    Shell标准输出、标准错误 >/dev/null 2>&1
    如何在linux中用命令产生一个范围内的随机数?
    SNMP协议
  • 原文地址:https://www.cnblogs.com/zsj576637357/p/2250533.html
Copyright © 2011-2022 走看看