Now,given the equation 8x^4 + 7x^3 + 2x^2 + 3x + 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!
思路分析:
很明显的二分。枚举所有小数基本不可能。给了x范围在[1,100],并且函数单调递增,保证有序状态。
r = mid-q. 以往的二分,q=1. 这里的 q = 1e-8可以保证一直二分到小数点很后面。
这里比较麻烦的是精度问题。经过不断的尝试,1e-8可以AC.
下面上代码:
#include <iostream>
#define ll long long
#define MIN 1e-8
using namespace std;
double f(double x)
{
return 8*x*x*x*x+7*x*x*x+2*x*x+3*x+6;
}
int main()
{
double l, r, mid, y;
int T;
cin>>T;
while(T--)
{
cin>>y;
l = 0, r = 100;
if(f(0) > y || f(100) < y)
{
printf("No solution!\n");
continue;
}
while(r-l>1e-8)
{
mid = (l+r)/2;
if(f(mid) > y) r = mid-MIN;
else if(f(mid)<y) l = mid+MIN;
}
printf("%.4lf\n",mid);
}
return 0;
}