UVA-573 The Snail

2016-08-08

UVA - 573 The Snail

题目大意：给出 H 井高，U 上爬距离，D 下滑距离，F 减少百分数。第一天爬 U，第二天比前一天减少 F%，每晚下滑 D，问成功（总爬行距离大于 H）或失败（距离小于 0）在第几天。

解题思路：模拟每天上爬和下滑，记录天数，每次距离变化后就判断，及时退出。

注意：第一天的模拟也要放在模拟过程循环内。

#include <iostream>
#include <cstdio>
using namespace std;

int main() {
int H, U, D, F;
while ( scanf("%d%d%d%d", &H, &U, &D, &F) != EOF && H ) {
int day = 1;
double IH = 0, DC = U, HAC = 0, HAS = 0;
while ( 1 ) {
IH = HAS;
HAC = IH + DC;
if ( HAC > H ) {
cout << "success on day " << day << endl;
break;
}
HAS = HAC - D;
if ( HAS < 0 ) {
cout << "failure on day " << day << endl;
break;
}
DC = DC - U * F * 0.01;
if ( DC < 0 )
DC = 0;
day++;
}
}
return 0;
}