ACM--steps--Can you solve this equation?

最新推荐文章于 2022-02-16 13:57:53 发布

木土的H

最新推荐文章于 2022-02-16 13:57:53 发布

阅读量470

点赞数

分类专栏：基础二分文章标签：基础题数字二分

本文链接：https://blog.csdn.net/wyx13109395842/article/details/43958477

版权

基础同时被 2 个专栏收录

141 篇文章 0 订阅

订阅专栏

二分

3 篇文章 0 订阅

订阅专栏

Can you solve this equation?

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

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!

Author

Redow

Recommend

lcy

#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
double dyx(double x)
{
    return 8 * pow(x, 4) + 7 * pow(x, 3) + 2 * pow(x, 2) + 3 * x + 6;
}
int main()
{
    //给出的是一个1元4次的方程，用二分法来找到解。
    int T;
    cin>>T;
    while(T--)
    {
        int ans;
        cin>>ans;//给出的是方程的解，让找到符合解的元。
        //有数学分析的知识，可以判断出方程为递增方程。
        double y1,y2,y3,x1,x2,x3;
        //首先最大范围是0~100；
        x1=0;
        x2=100;
        y1=dyx(x1)-ans;
        y2=dyx(x2)-ans;
        //判断是否有解。
        if(y1>0||y2<0)
        cout<<"No solution!"<<endl;
        else
        {
            //题给出的要求是到精确到小数点后4位。
            while(fabs(y1-y2)>=0.0001)
            {
                //进行二分。
            x3=(x1+x2)/2;
            y3=dyx(x3)-ans;
            //判断是更新左端点还是更新右端点。
            if(y3>=0)
            x2=x3;
            else
            x1=x3;
            y1=dyx(x1)-ans;
            y2=dyx(x2)-ans;
            }
          cout<<fixed<<setprecision(4)<<x3<<endl;
        }
    }
    return 0;
}