洛谷P1033 自由落体

最新推荐文章于 2021-08-02 05:31:27 发布

weixin_49036302

最新推荐文章于 2021-08-02 05:31:27 发布

阅读量121

点赞数

本文链接：https://blog.csdn.net/weixin_49036302/article/details/107110254

版权

#include <iostream>
#include <cmath>


using namespace std;

double H, S1, V, L, K, n;
double e = 0.0001;
int num = 0;

int main()
{
    cin >> H >> S1 >> V >> L >> K >> n;
    double t1 = sqrt(H / 5), t2 = sqrt((H - K) / 5);
    double t3, t4;
    for (int i = 0; i < n; i++)
    {
        t3 = (S1 - i - e) / V;
        t4 = (S1 + L - i + e) / V;
        if ((t3 <= t1 && t3 >= t2) || (t4 <= t1 && t4 >= t2) || (t3 <= t2 && t1 <= t4))
            num++;
    }
    cout << num << endl;
}