他么的精度!!!!!
#include<stdio.h>
#include<string.h>
#include<cmath>
#include<cstdlib>
#include<set>
#include<queue>
#include<algorithm>
#include<iostream>
using namespace std;
int i,j,k,t;
double n,l,r;
double binsearch(double l,double r,double n)
{
if(r-l<1e-8)return r;
double mid=(l+r)/2;
if(8*mid*mid*mid*mid+7*mid*mid*mid+2*mid*mid+3*mid+6-n<1e-20)return binsearch(mid,r,n);
else return binsearch(l,mid,n);
}
int main()
{
scanf("%d",&t);
while(t--)
{
scanf("%lf",&n);
if(n<6||n>8*100*100*100*100 + 7*100*100*100 + 2*100*100 + 3*100 + 6){printf("No solution!\n");continue;}
double ans=binsearch(0.0,100.0,n);
printf("%.4lf\n",ans);
}
return 0;
}