lanqiao OJ 1217 求立方根

#include<iostream>
#include<cstring>
#include<algorithm>
 
using namespace std ;
 
double n;
bool check(double x){
  if(x*x*x > n) return true ;
  else return false ;
}
 
int main(){
  int t ; cin >> t ;
  while(t --){
    cin >> n ;
    double l = 0 , r = 100 ;
    while(r-l > 1e-8){
      double mid = (l + r) / 2 ;
      if(check(mid)) r = mid;
      else l = mid ;
    }
    printf("%.3f\n",l) ;
  }
  
}