标签：c++ c语言 算法 acm
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
--------------------
思路其实和以前的蜗牛爬井没啥区别 只是多了一个能量损失的条件：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.
#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
double h,u,d,f,he=0,pos=0;
int flag=0;
while(cin>>h>>u>>d>>f)
{
he=0,pos=0;
flag=0;
double slow=u*(f/100); //求出损失能量的固定值 注意用double或者float
//u-d u*(1-f/100)-d
for(int i=0;i<100000;i++) //死循环也可以
{
if(pos+d>h){cout<<"success on day "<<flag<<endl;break;} //如果没有下滑就爬出井 成功
if(pos<0/*u-d<0*/){cout<<"failure on day "<<flag<<endl;break;}//如果位移小于0(跌落井底且能量不足) 失败
flag++; //天数增加 注意这个地方天数增加一定要放在pos改变的前面
pos+=u-d;//pos改变
u-=slow;//能量损失
//else
/*if(u-d>0)
{
h-=(u-d);
u-=slow;
flag++;
}
if(h-d<0){cout<<flag;break;}
//if(u-d<0){cout<<"flag";break;}*/
}
}
}
杭电ACM：A snail（附源码）
标签：c++ c语言 算法 acm
原文地址：http://blog.csdn.net/qq754406613/article/details/43150883
