HDU-2199 二分查找

/*给出方程：
       8*x4 + 7*x3 + 2*x2 + 3*x + 6 = Y
其中，实数Y满足 (fabs(Y) <= 1e10)


请输出x在区间[0,100]的解，结果精确到小数点后4位。


  当数很大的时候用暴力枚举就不适合，所以采用二分查找
*/

Problem Description

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 <cmath>
using namespace std;
double Y;
double l, r, m;
double f( double x )
{    return 8*pow(x, 4.0) + 7*pow(x, 3.0) + 2*pow(x, 2.0) + 3*x + 6;}
int main() {
    int t;
    scanf("%d", &t );
    while( t-- ) {
        scanf("%lf", &Y );
        if( f(0) <= Y && Y <= f(100) ) {
            l = 0;
            r = 100;
            while( r - l > 1e-6 ) {
                m = (l + r) / 2;  //折半
                double ans = f(m);
                if( ans > Y ) {
                    r = m - 1e-7;
                }else
                    l = m + 1e-7;
            }
            printf("%.4lf\n", (l + r) / 2 );
        }else
            printf("No solution!\n");
    }
	return 0;
}