CodeForces 148B Escape

F - Escape

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 148B

Description

The princess is going to escape the dragon's cave, and she needs to plan it carefully.

The princess runs at v_p miles per hour, and the dragon flies at v_d miles per hour. The dragon will discover the escape after t hours and will chase the princess immediately. Looks like there's no chance to success, but the princess noticed that the dragon is very greedy and not too smart. To delay him, the princess decides to borrow a couple of bijous from his treasury. Once the dragon overtakes the princess, she will drop one bijou to distract him. In this case he will stop, pick up the item, return to the cave and spend f hours to straighten the things out in the treasury. Only after this will he resume the chase again from the very beginning.

The princess is going to run on the straight. The distance between the cave and the king's castle she's aiming for is c miles. How many bijous will she need to take from the treasury to be able to reach the castle? If the dragon overtakes the princess at exactly the same moment she has reached the castle, we assume that she reached the castle before the dragon reached her, and doesn't need an extra bijou to hold him off.

Input

The input data contains integers v_p, v_d, t, f and c, one per line (1 ≤ v_p, v_d ≤ 100, 1 ≤ t, f ≤ 10, 1 ≤ c ≤ 1000).

Output

Output the minimal number of bijous required for the escape to succeed.

Sample Input

Input

1
2
1
1
10

Output

2

Input

1
2
1
1
8

Output

1

Hint

In the first case one hour after the escape the dragon will discover it, and the princess will be 1 mile away from the cave. In two hours the dragon will overtake the princess 2 miles away from the cave, and she will need to drop the first bijou. Return to the cave and fixing the treasury will take the dragon two more hours; meanwhile the princess will be 4 miles away from the cave. Next time the dragon will overtake the princess 8 miles away from the cave, and she will need the second bijou, but after this she will reach the castle without any further trouble.

The second case is similar to the first one, but the second time the dragon overtakes the princess when she has reached the castle, and she won't need the second bijou.

题意博主就不细说了，......做了之后发现就是个纯粹的模拟题...具体步骤代码中说就可以了。可能是组队赛打多了，喜欢一道题扣个差不多，水题都没看......

注意：

1.虽然给定的是整数，但是存在速度和路程不成倍数的情况，所以要用实数。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;

int main()
{
    int vp,vd,t,f,c;
    scanf("%d%d%d%d%d",&vp,&vd,&t,&f,&c);
    if(vd<=vp)puts("0");//这种情况龙永远追不上公主
    else
    {
        int g=vd-vp;//龙追公主的相对速度
        double  sum=0;
        int ans=0;
        sum+=t*1.0*vp;//最初公主先走的路程
        sum+=(sum/g)*vp;//第一次龙开始追赶
        while(sum<c)
        {
            ans++;//两个碰面，表示这个时候还没走完，要使用一次高科技
            double x=vp*(f+sum/vd);//龙返回并且要待上f个小时
            sum+=x;
            //这之后才从起点开始追逐
            sum+=(sum/g)*vp;
        }
        printf("%d\n",ans);
    }
    return 0;
}

比较水的模拟.....