CodeForces 148BEscape(数学)

#include<iostream>#include<cstdio>#include<algorithm>#include<cstdlib>using namespace std;typedef long long ll;ll ans[120];#define sp  system("pause");int main(){double vd, vp, t, f, c;cin >> vp >> vd >> t >> f >> c;if (vp >= vd){cout << 0 << endl;return 0;}double pos = t * vp;int st = 0;while (pos < c){pos += pos / (vd - vp) * vp;//cout << "in\n";//cout << pos << endl;if (pos >= c)break;st++;double tim = pos / vd;pos += (tim + f) * vp;//pos += pos / (vd - vp) * vp;}cout << st << endl;return 0;}