#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#define INF 10e7
using namespace std;
const int maxn=505;
double deal(double x)
{
return 8*pow(x,4)+7*pow(x,3)+2*pow(x,2)+3*x+6;
}
double binarch(double Y)
{
double l=0,r=100;
double mid;
//cout<<1e-6<<endl;
while(r-l>1e-6){
mid=(l+r)/2;
if(deal(mid)>Y)r=mid;
else l=mid;
}
return r;
}
int main()
{
int cas=1;
int T;
double y;
scanf("%d",&T);
while(T--){
scanf("%lf",&y);
if(y<deal(0.0)||y>deal(100.0)){printf("No solution!\n");continue;}
printf("%.4lf\n",binarch(y));
}
return 0;
}
hdu 2199 高精度二分模板
最新推荐文章于 2017-07-26 08:31:29 发布