hdu2199 Can you solve this equation? 二分+精度

最新推荐文章于 2021-02-10 11:42:51 发布

原创最新推荐文章于 2021-02-10 11:42:51 发布 · 322 阅读

0 ·

CC 4.0 BY-SA版权

本文为博主原创文章，未经博主允许也可以转载。

二分专栏收录该内容

33 篇文章

订阅专栏

本文介绍了一种通过二分查找法求解特定多项式方程的数值解的方法，并提供了一个C++实现示例，该方法适用于求解形式为8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 = Y，在[0, 100]区间内的实数解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Can you solve this equation?

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 23715 Accepted Submission(s): 10245

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!

思路：由于函数是单调的，所以可以二分答案，这里精度控制在1e6-1e7可以过。

Code：

#include <bits/stdc++.h>
#define LL long long 
#define INF 1e-6
using namespace std;
double f ( double x ){
    double ans = 8.0 * x *x * x * x + 7.0 *x*x*x + 2.0 *x*x+3.0*x+6.0;
    return ans ;    
}
int main(){
    int n;
    cin >> n ;
    double y;
    while( n-- ){
        cin >> y ;
        double l = 0.0 , r = 100.0;
        if( f(l) > y || f(r) < y ){
            cout<<"No solution!"<<endl;
        }else{
            while( r - l > 1e-7 ){
                double mid = ( l + r ) / 2.0;
                double re = f(mid);
                if( re > y ){
                    r = mid - 1e-7;
                }else{
                    l = mid + 1e-7 ;
                }
            }
            printf("%.4lf\n", (l+r)/2.0);
        }
    }
    return 0 ;
}