二分查找

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!

AC代码：

#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const int N=1000+10;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int find(double x,double y)
{
	if(y-(8.0*pow(x,4)+7.0*pow(x,3)+2.0*pow(x,2)+3.0*x+6)<0)
	   return 1;
	else
	   return 0;
}
int main()
{
	int T;
	double y,mid,l,r;
	scanf("%d",&T);
	while(T--)
	{
		l=0;
		r=100;
		scanf("%lf",&y);
		if(y<6||y>807020306)
		   cout<<"No solution!"<<endl;
		else
		{
			while(r-l>1e-8)
			{
				mid=(r+l)/2.0;
				if(find(mid,y))
                    r=mid;
				else
                    l=mid;
			}
			printf("%.4lf\n",mid);
		}
	}
	return 0;
}