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!
就是个二分了,注意精度就好,使用递归去二分暴了,哎,渣渣
#include<algorithm>
#include<stdio.h>
#include<math.h>
#include<iostream>
using namespace std;
double n;
const double vv=0.000001;
double js(double x)
{
return 8*x*x*x*x + 7*x*x*x + 2*x*x + 3*x + 6;
}
double binary(double x,double y)
{
while(x<y)
{
double m=x+(y-x)/2;
if(fabs(js(m)-n)<=vv)
return m;
else if(js(m)-n>=vv)
y=m;
else
x=m;
}
return -1;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%lf",&n);
if(binary(0,100)==-1)
printf("No solution!\n");
else
printf("%.4f\n",binary(0,100));
}
return 0;
}
正常二分就好了,强调精度。。