CodeForces 148B Escape（模拟）

The princess is going to escape the dragon’s cave, and she needs to plan it carefully.
The princess runs at vp miles per hour, and the dragon flies at vd 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 vp, vd, t, f and c, one per line (1 ≤ vp, vd ≤ 100, 1 ≤ t, f ≤ 10, 1 ≤ c ≤ 1000).
Output
Output the minimal number of bijous required for the escape to succeed.
Examples
Input
1
2
1
1
10
Output
2
Input
1
2
1
1
8
Output
1

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
using namespace std;

int main()
{
	double vp, vd, t, f, c;
	double mp=0, md=0;
	int count=0;
	
	scanf("%lf%lf%lf%lf%lf", &vp, &vd, &t, &f, &c);
	mp+=vp*t;
	if (vp>=vd){
		printf("0\n");
		return 0;
	}
	
	double tt=mp/(vd-vp);
	mp+=tt*vp;
	while (mp<c){
		count++;
		mp+=((mp/vd)+f)*vp;
		double tt=mp/(vd-vp);
		mp+=tt*vp;
	}
	printf("%d\n", count);
	return 0;
}