hdu1302

The Snail

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 1426    Accepted Submission(s): 1043

题目链接： http://acm.hdu.edu.cn/showproblem.php?pid=1302

Problem Description

A snail is at the bottom of a 6-foot well and wants to climb to the top. The snail can climb 3 feet while the sun is up, but slides down 1 foot at night while sleeping. The snail has a fatigue factor of 10%, which means that on each successive day the snail climbs 10% * 3 = 0.3 feet less than it did the previous day. (The distance lost to fatigue is always 10% of the first day's climbing distance.) On what day does the snail leave the well, i.e., what is the first day during which the snail's height exceeds 6 feet? (A day consists of a period of sunlight followed by a period of darkness.) As you can see from the following table, the snail leaves the well during the third day.

Day Initial Height Distance Climbed Height After Climbing Height After Sliding
1 0 3 3 2
2 2 2.7 4.7 3.7
3 3.7 2.4 6.1 -

Your job is to solve this problem in general. Depending on the parameters of the problem, the snail will eventually either leave the well or slide back to the bottom of the well. (In other words, the snail's height will exceed the height of the well or become negative.) You must find out which happens first and on what day.

 

Input

The input file contains one or more test cases, each on a line by itself. Each line contains four integers H, U, D, and F, separated by a single space. If H = 0 it signals the end of the input; otherwise, all four numbers will be between 1 and 100, inclusive. H is the height of the well in feet, U is the distance in feet that the snail can climb during the day, D is the distance in feet that the snail slides down during the night, and F is the fatigue factor expressed as a percentage. The snail never climbs a negative distance. If the fatigue factor drops the snail's climbing distance below zero, the snail does not climb at all that day. Regardless of how far the snail climbed, it always slides D feet at night.

 

Output

For each test case, output a line indicating whether the snail succeeded (left the well) or failed (slid back to the bottom) and on what day. Format the output exactly as shown in the example.

 

Sample Input

  
  

   
   6 3 1 10
10 2 1 50
50 5 3 14
50 6 4 1
50 6 3 1
1 1 1 1
0 0 0 0
  
  

 

Sample Output

  
  

   
   success on day 3
failure on day 4
failure on day 7
failure on day 68
success on day 20
failure on day 2
  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  

   
   解题思路：
  
  
  
  

   
      题目大意是说给出h、u、d、f,分别代表井的高度、白天爬的距离、晚上滑落的距离、疲劳度。问是否能爬出井，
  
  
  
  

   
   给出具体日期（成功或失败）。
  
  
  
  

   
      暴力模拟····注意疲劳度（每次减少的距离）只取决于第一天爬的距离，即per = u * (f / 100.0)；还有就
  
  
  
  

   
   是如果u <= 0 时，当天蜗牛不会爬，但是照常滑落·····
  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  

   
   完整代码：
  
  
  
  

   
   
#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <climits>
#include <cassert>
#include <complex>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>

using namespace std;

typedef long long LL;
typedef double DB;
typedef unsigned uint;
typedef unsigned long long uLL;

/** Constant List .. **/ //{

const int MOD = int(1e9)+7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const DB EPS = 1e-9;
const DB OO = 1e20;
const DB PI = acos(-1.0); //M_PI;

int main()
{
    #ifdef ZH
    freopen("in.txt","r",stdin);
    #endif
    double h , u , d , f;
    while(~scanf("%lf%lf%lf%lf",&h,&u,&d,&f) && h)
    {
        if(h == 0)
            break;
        int day = 1;
        double high = 0;
        double per = u * (f / 100.0);
        int flag1 = 0 , flag2 = 0;
        while(high <= h && high >= 0)
        {
            if(u > 0)
                high += u;
            if(high > h)
            {
                flag1 = 1;
                break;
            }
            high -= d;
            u -= per;
            if(high < 0)
            {
                flag2 = 1;
                break;
            }
            day ++;
        }
        if(flag1 == 1)
            printf("success on day %d\n",day);
        else if(flag2 == 1)
            printf("failure on day %d\n",day);
    }
}