Now,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100;
Now please try your lucky.
Input
The first line of the input contains an integer T(1<=T<=100) which means the number of test cases. Then T lines follow, each line has a real number Y (fabs(Y) <= 1e10);
Output
For each test case, you should just output one real number(accurate up to 4 decimal places),which is the solution of the equation,or “No solution!”,if there is no solution for the equation between 0 and 100.
Sample Input
2 100 -4
Sample Output
1.6152 No solution!
#include<iostream>
#include<stdio.h>
#include<map>
#include<algorithm>
#include<math.h>
#include<queue>
#include<stack>
#include<string>
#include<cstring>
using namespace std;
#define ll long long
double ans(double x)
{
return 8*x*x*x*x+7*x*x*x+2*x*x+3*x+6;
}
int main()
{
int t;
cin>>t;
while(t--)
{
double y;
scanf("%lf",&y);
/*if(y<6)
{
printf("No solution!\n");
continue;
}
*/
double l=-600,r=600,mid=(l+r)/2;
while(r-l>0.0000001)
{
mid=(l+r)/2;
if(ans(mid)>y){
r=mid;
}
else if(ans(mid)<y){
l=mid;
}
else{
break;
}
}
if(mid>=0&&mid<=100)
{
printf("%.4lf\n",mid);
}
else{
printf("No solution!\n");
//cout<<mid<<l<<r<<endl;
}
}
}