HDOJ 题目1302 The Snail(模拟,水题)
2014-11-09 23:38
399 查看
The Snail
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1480 Accepted Submission(s): 1084
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
Source
Mid-Central USA 1997
Recommend
Eddy | We have carefully selected several similar problems for you: 1304 1306 1305 1323 1320
ac代码
#include<stdio.h> int main() { double h,u,d,f,s; while(scanf("%lf%lf%lf%lf",&h,&u,&d,&f)!=EOF,h) { int day=0; double sum=0; s=f*u/100; while(1) { if(sum>h) { printf("success on day %d\n",day-1); break; } else if(sum<0) { printf("failure on day %d\n",day); break; } else { day++; sum+=u; sum-=d; u-=s; } } } }
相关文章推荐
- HDOJ 题目1795 The least one(水题)
- hdu 1302 The Snail (模拟)
- hdoj 1302 The Snail
- 1302 The Snail【模拟】
- hdu 1302 The Snail (模拟)
- HDOJ 1302(UVa 573) The Snail(蜗牛爬井)
- HDOJ 1302(UVa 573) The Snail(蜗牛爬井)
- HDOJ题目1052Tian Ji -- The Horse Racing(贪心)
- HDOJ 1156 - Color the ball 水题复习线段树..线段树与树状数组的对比..
- codeforces 266A Stones on the Table(模拟水题)
- HDOJ 题目2036 改革春风吹满地(数学,几何,水题)
- HDOJ 题目2018母牛的故事(递推 水题)
- HDOJ 题目2030 汉字统计(水题)
- hdoj 1032 The 3n + 1 problem (数学水题递推)
- HDOJ题目2105The Center of Gravity
- HDOJ 题目2601 An easy problem(数学 水题)
- HDOJ题目3783 ZOJ(水题)
- HDOJ 继续水题,杭电2057 ,A+B again题目,关于进制输出的格式小技巧
- HDOJ 题目1028Ignatius and the Princess III(母函数模板)
- HDOJ 题目2438 Turn the corner(三分搜索)