HDOJ 题目1302 The Snail(模拟,水题)
来源:互联网 发布:it薪资排行 编辑:程序博客网 时间:2024/06/06 02:38
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.
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 1010 2 1 5050 5 3 1450 6 4 150 6 3 11 1 1 10 0 0 0
Sample Output
success on day 3failure on day 4failure on day 7failure on day 68success on day 20failure 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;}elseif(sum<0){printf("failure on day %d\n",day);break;}else{day++;sum+=u;sum-=d;u-=s;}}}}
0 0
- HDOJ 题目1302 The Snail(模拟,水题)
- HDOJ 1302 The Snail(水题)
- hdoj 1302 The Snail
- HDOJ The Snail 1302
- hdoj 1302 The Snail
- HDOJ 1302-The Snail
- HDOJ 1302 The Snail
- 1302 The Snail【模拟】
- hdu 1302 The Snail (模拟)
- HDU 1302 The Snail(模拟题)
- hdoj.1302 The Snail 20140819
- HDU 1302 The Snail【模拟】
- hdoj The Snail
- uva 573 The Snail(模拟)
- hdu 1302(The Snail)
- HDOJ 1302(UVa 573) The Snail(蜗牛爬井)
- UVa 573 The Snail (模拟)
- HDU 1302 The Snail(简单数学题)
- 循环右移位举例
- java读取文件夹中的文件名并排序显示
- http协议详解
- 湫湫系列故事——减肥记I(杭电4508)(完全背包)
- 读取文件夹中文件路径
- HDOJ 题目1302 The Snail(模拟,水题)
- POJ-1944(枚举拆环)
- Android 动态显示和隐藏软键盘
- 第一轮 L
- Ogre输出屏幕2d文字(Overlay文字)
- exit函数的妙用
- py2exe使用教程(五)——指定额外文件
- Session简介,创建与销毁
- CC150:将一个矩阵旋转90度