bool check(int x) {/* ... */} // 檢查x是否滿足某種性質(zhì)

// 區(qū)間[l, r]被劃分成[l, mid]和[mid + 1, r]時(shí)使用：
int bsearch_1(int l, int r)
{
    while (l < r)
    {
        int mid = l + r >> 1;
        if (check(mid)) r = mid;    // check()判斷mid是否滿足性質(zhì)
        else l = mid + 1;
    }
    return l;
}
// 區(qū)間[l, r]被劃分成[l, mid - 1]和[mid, r]時(shí)使用：
int bsearch_2(int l, int r)
{
    while (l < r)
    {
        int mid = l + r + 1 >> 1;
        if (check(mid)) l = mid;
        else r = mid - 1;
    }
    return l;
}

#include<iostream>

using namespace std;
const int N = 100000+10;
int q[N];

int main()
{
    int n, m;
    cin>> n >> m;
    
    for(int i = 0; i < n; i++) cin>>q[i];
    while(m--)
    {
      int x;
      cin>> x;
      // 尋找起始位置
      int l = 0, r = n - 1;
      while(l < r)
      {
          int mid =(l + r)/2;
          if(q[mid] >= x) r = mid;
          else l = mid + 1;
      }
      if(q[l] != x) cout<<"-1 -1"<<endl;
      else{
          cout<<l<<" ";
          // 尋找終點(diǎn)位置
          int l = 0, r = n - 1;
          while(l<r)
          {
              int mid = (l + r + 1)/2;
              if(q[mid] <= x) l = mid;
              else r = mid - 1;
          }
          
          cout<< l << endl;
      }
       
    }
    return 0;
}

class Solution {
public:
    int getMissingNumber(vector<int>& nums) {
        if(nums.size() == 0) return 0;
        int l = 0, r = nums.size() - 1;
        while(l < r)
        {
            int mid = (l + r)/2;
            if(nums[mid] != mid) r = mid; //在紅色半邊(滿足條件)
            else l = mid + 1;
        }
        
        //缺的是n這個(gè)數(shù)
        if(nums[r] == r) r++;
        
        return r;
        
    }
};

浮點(diǎn)數(shù)二分算法模板 —— 模板題 AcWing 790. 數(shù)的三次方根
bool check(double x) {/* ... */} // 檢查x是否滿足某種性質(zhì)（包含了計(jì)算和條件）

double bsearch_3(double l, double r)
{
    const double eps = 1e-6;   // eps 表示精度，取決于題目對(duì)精度的要求(一般比題目要求的大2)
    while (r - l > eps)
    {
        double mid = (l + r) / 2;
        if (check(mid)) r = mid;
        else l = mid;
    }
    return l;
}

#include<iostream>

using namespace std;

int main()
{   
    double n;
    cin>>n;
    
    double l = -10000, r = 10000;
     // eps 表示精度，取決于題目對(duì)精度的要求(保險(xiǎn)1e-8)
    const double eps = 1e-8;  
    while(r - l > eps)
    {
        double mid = (l + r) / 2;
        if(mid * mid * mid >= n) r = mid;
        else l = mid;
    }
    
     printf("%.6lf\n", l);
    return 0;
    
}

#include<iostream>
#include<cstdio>

using namespace std;

double a, b, c, d;// 全局變量方便在cal中使用
const double eps = 1e-6;// 定義精度

//計(jì)算一元三次方程
double cal(double x)
{
    return a*x*x*x + b*x*x + c*x + d;
}
int main()
{
    cin>>a>>b>>c>>d;
    
    //枚舉根
    for(int i = -100; i <= 100; i++)
    {
        //根與根之差的絕對(duì)值 ≥1
        double l = double(i), r = double(i + 1);// 細(xì)節(jié):要將l,r轉(zhuǎn)為double
        if(cal(l) == 0) printf("%.2lf ", l); //若f(x) = 0，根即為x 
        
        //f(x1)×f(x2) < 0 根在（x1,x2）之間—— 浮點(diǎn)二分
        else if(cal(l) * cal(r) < 0)
        {
            while(r - l > eps)
            {
                //x1 < x，f(x1)×f(x2)<0，則在(x1, x2)之間一定有一個(gè)根
                double mid = (l + r)/2;
                // check()條件
                if(cal(l) * cal(mid) <= 0) r = mid;
                else l = mid;
            }
            
            printf("%.2lf ", l);
        }
    }
}

#include <bits/stdc++.h>
using namespace std;

double check(double x)
{
    return 7*x*x*x*x + 5*x*x*x + 11*x + 6;
} 
double erfen(double Y)
{
    double l=0.0, r=99.0, mid;
    while(r - l > 1e-6){
        mid = (l + r)/2;
        if(check(mid) > Y) r = mid;
        else l = mid;
    }
    return mid;
}
int main()
{
    double Y;
    while(~scanf("%lf", &Y)){
        if(Y < 6 || Y > 677269824)
            puts("None");
        else
        printf("%.4f\n", erfen(Y));
    }
    return 0;
}