HDU 1302 模拟

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
#define ll long long
#define MAXN 100
int H, U, D, F;
int main()
{ 
	while (scanf("%d%d%d%d", &H, &U, &D, &F) != EOF && H != 0)
	{
		int day = 1;
		double climb_decrement = 1.0 * F / 100 * U;
		//printf("climb_decrement=%lf\n", climb_decrement);
		double climb;
		double height=0;
		while (1)
		{
			climb = day * (-climb_decrement) + U + climb_decrement;
			//printf("climb=%lf\n", climb);
			if (climb+height > H)
			{
				printf("success on day %d\n", day);
				break;
			}
			height = height+climb - D;
			//printf("height=%lf\n",height);
			if (height < 0)
			{
				printf("failure on day %d\n", day);
				break;
			}
			day++;
		}
	}
	return 0;
}