HDOJ 1302-The Snail
2015-12-28 13:59
405 查看
Total Submission(s): 2072 Accepted Submission(s): 1464
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
[align=left]Sample Output[/align]
[align=left]Source[/align]
Mid-Central USA 1997
解题思路:
H-总高 U-初始速度 D-下滑距离 F-速度下降的概率 先计算出每次速度下降的大小为U*F 然后统计出天数,当天起点高度,爬升距离,爬升后的高度,下滑后的高度 然后下滑后的高度小于0就失败 爬升后的高度大于总高度就成功。
The Snail
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2072 Accepted Submission(s): 1464
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
success on day 3 failure on day 4 failure on day 7 failure on day 68 success on day 20 failure on day 2
[align=left]Source[/align]
Mid-Central USA 1997
解题思路:
H-总高 U-初始速度 D-下滑距离 F-速度下降的概率 先计算出每次速度下降的大小为U*F 然后统计出天数,当天起点高度,爬升距离,爬升后的高度,下滑后的高度 然后下滑后的高度小于0就失败 爬升后的高度大于总高度就成功。
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int main() { double h,u,d,f; double sh,ph,suh,xih,t; int day=0; while(~scanf("%lf%lf%lf%lf",&h,&u,&d,&f)) { if(!h) break; f=f/100; t=u*f; sh=ph=suh=xih=0; day=0; int flag=1; while(suh<=h) { ph=u; suh=sh+ph; xih=suh-d; sh=xih; u-=t; if(u<=0) { u=t=0; } day++; if(xih<0) { flag=0; break; } } if(flag) printf("success on day %d\n",day); else printf("failure on day %d\n",day); } return 0; }
相关文章推荐
- HDU 4300 Clairewd’s message(扩展KMP)
- Windows 2008 Domain Controller
- Daily Scrum 12-25
- drawing, sketch and painting
- dns(domain name server) 主从
- RAID磁盘阵列学习笔记
- wait和notify在锁竞争中的执行顺序
- Failed to execute goal org.apache.maven.plugins:maven-surefire-plugin:2.10:test (default-test)
- DomainHelper
- c中的main函数
- 【构】使用行为树(Behavior Tree)实现游戏AI
- 运行QQ出现initialization failure 0x0000000c错误和浏览器上不了网
- 循环引用, 如果都是对象, 使用 retain + assign
- Linux ->> UBuntu ->> Could not get lock /var/lib/dpkg/lock - open (11: Resource temporarily unavailable)
- Climbing Stairs
- 使用MegaCli监控H700 Raid卡磁盘
- poj 1363 Rails 数组模拟栈操作
- raid lvm介绍
- Unix Domain Socket– IPC通信机制
- The Longest Straight(二分,离散化)