Submission #1868563

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;

template<class T> void vin(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
}

double a, b, c;

double f(double t) {
    return a * t + b * sin(c * t * M_PI);
}

int main() {
    cin >> a >> b >> c;
    double l = 0, r = 1e8;
    rep(i, 1000000) {
        double m = (r + l) / 2.0;
        double tmp = f(m);
        if ( tmp < 100.0000000000 ) {
            l = m;
        }
        else {
            r = m;
        }
    }
    printf("%.12f\n", r);
}

Submission Info

Judge Result