学步园

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.

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.

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.

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

success on day 3
failure on day 4
failure on day 7
failure on day 68
success on day 20
failure on day 2
#include<stdio.h>
int main()
{
    double h,u,s,p,sum,k;
    int day,flog;
    while(scanf("%lf%lf%lf%lf",&h,&u,&s,&p)==4&&(h||u||s||p))
    {
        day=0;flog=1;
        sum=0;//代表走的距离
        k=u*p/100;//疲劳后每天少走的路程
        while(sum<=h)
        {
            day++;
           sum+=u;//u表示白天走的路程
           if(sum>h)//白天走出了井
           break;
           sum-=s;//晚上下划
           
        if(sum<0)//从这天起一直就在井底,走不出来
            {
                flog=0;break;
            }
            u=u-k;//第二天白天走的路程
        }
        if(flog)
        printf("success on day %d\n",day);
        else
        printf("failure on day %d\n",day);
    }
    return 0;
}