解题思路:
二分法
代码实现:
#include<iostream>
#include<cmath>
using namespace std;
double f(double x)
{
return 8*pow(x,4)+7*pow(x,3)+2*pow(x,2)+3*x+6;
}
int main()
{
int t;
cin>>t;
while(t--)
{
double y,left=0,right=100.0;
double mid=(left+right)/2;
cin>>y;
if(f(0)>y||f(100)<y)
cout<<"No solution!"<<endl;
else
while(right-left>1e-7)
{
if(f(mid)==y)
break;
else if(y<f(mid))
right=mid+1e-7;
mid=(left+right)/2;
}
printf("%.4f\n",mid);
}
}
return 0;
}