AcWing790：数的三次方

AcWing790：数的三次方

题目

思路

代码

#include<iostream>
using  namespace std;

bool check(double x, double n) {
    if (x * x * x > n)
        return true;
    else
        return false;

}

double bsearch(double left, double right, double n)
{
    const double eps = 1e-12;
    while (right - left > eps)
    {
        double mid = (left + right) / 2;
        if (check(mid, n))
            right = mid;
        else
            left = mid;
    }
    return left;
}

int main() {
    double N;
    cin >> N;
    double res = bsearch(-10000, 10000, N);
    printf("%.6f\n", res);
    return 0;
}