UVA 573 The Snail
2015-09-12 21:19
351 查看
yiyi:有给测试数据, H 表示墙的高度 U表示白天能爬多少 D表示万事下降多少 F表示疲劳程度 (每天爬的高度都会减少H*F%) 蜗牛是不会往下爬的 要求输出 在第几天爬出 或者在第几天掉回原点。
成功>H 失败 < 0;
题目:
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.
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.
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 Dfeet
at night.
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.
答案:
成功>H 失败 < 0;
题目:
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' | - |
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 Dfeet
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
答案:
#include <iostream> #include <stdio.h> using namespace std; int main () { double H, U, D, F; int term; while (scanf("%lf%lf%lf%lf", &H, &U, &D, &F) != EOF) { if (H == 0 && U == 0 && D == 0 && F == 0) break; term = 1; double ini = 0; double down = F * U / 100.0; while (1) { if (U > 0) ini = ini + U; if (ini > H) { printf("success on day %d\n", term); break; } ini = ini - D; U = U - down; if (ini < 0) { printf("failure on day %d\n", term); break; } term++; } } return 0; }
相关文章推荐
- Linux学习之进程fork()、exec、exit()/_exit()、wait()/waitpid
- USACO 1.3 Barn Repair (快排+贪心)
- Terrain maps
- 广义表的head与tail的基本用法
- LeetCode Factorial Trailing Zeroes
- LeetCode Factorial Trailing Zeroes
- STL 中iterator_traits
- main函数和启动例程(Startup Routine)
- 深入解读Quartz的原理(job-jobDetail-Trigger-scheduler)
- rails学习笔记:维护商品信息任务A
- POJ 3411 Paid Roads
- feof 编辑 http://baike.baidu.com/link?url=9jDAPGbHghkBT0Wd_vYusfglfk8GnCUda921gIyMwheS6P-Gy-xP8Ep
- 使用行为树(Behavior Tree)实现游戏AI
- URL tailing slash
- hdu5029 Relief grain 点权树链剖分,线段树
- 【LeetCode】172. Factorial Trailing Zeroes
- Drainage Ditches---hdu1532(最大流, 模板)
- bundle update rails 报错处理
- State模式及与Strategy/Commmand/Chain of Resposibility区别
- kamailio服务器内容补充