http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29592#problem/H
// File Name: bo_jwolf8.cpp
// Author: rudolf
// Created Time: 2013年08月19日 星期一 15:50:41
#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>
using namespace std;
int main()
{
bool flag ;
double h , u , d , f , tempu , day , temph , hight ;
while( cin >> h >> u >> d >>f && ( h || u || d || f ) )
{
tempu = 1.0 * f / 100 * u;
temph = h ;
flag = 0 ;
hight = 0 ;
day = 0 ;
while( hight >= 0 && hight <=h )
{
day++ ;
hight += u ;
if( hight > h )
{
break ;
}
hight -= d ;
u -= tempu ;
if( u <= 0 )
u = 0 ;
}
if( hight <= h )
{
cout << "failure on day " ;
}
else
{
cout << "success on day " ;
}
cout << day << endl ;
}
return 0;
}