Strange fuction

Problem Description

Now, here is a fuction:
  F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 <= x <=100)
Can you find the minimum value when x is between 0 and 100.

 

 

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 only one real numbers Y.(0 < Y <1e10)

 

 

Output

Just the minimum value (accurate up to 4 decimal places),when x is between 0 and 100.

 

 

Sample Input

2

100

200

 

 

Sample Output

-74.4291

-178.8534

#include <iostream>
#include<cstdio>
#include<cmath>
const double eps = 1e-6;
using namespace std;
double hs(double x,double y)
{
	return 6*pow(x,7)+8*pow(x,6)+7*pow(x,3)+5*pow(x,2)-y*x;
}
// double ds(double x,double y)
//{
//	return 42*pow(x,6)+48*pow(x,5)+21*pow(x,2)+10*pow(x,1)-y;	
//}
int main(){
	int a;
	scanf("%d",&a);
	while(a--)
	{
	double l,r,mid,midmid,b;
	scanf("%lf",&b);
	l=0.0;
	r=100.0;
	while(r-l>eps){
		mid=(l+r)/2;
		midmid = (mid+r)/2;
		if(hs(mid,b)>hs(midmid,b))l=mid;
		else r=midmid;
	}	
		printf("%.4lf\n",hs(mid,b));
	}
	return 0;
}