浮点数二分查找模板

#include<iostream>
using namespace std;

double n;

int main()
{
    cin >> n;
    double left = -1000, right = 1000;  // left 和 right 根据题目调整在适当范围内
    while(right - left > 1e-9)
    {
        double mid = (right + left) / 2;
        if(mid * mid * mid >= n) right = mid;
        else left = mid;
    }
    printf("%.6lf\n", left);
    return 0;
}