Solve It UVA - 10341

最新推荐文章于 2018-09-12 20:42:40 发布

元素不会背元素周期表

最新推荐文章于 2018-09-12 20:42:40 发布

阅读量303

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/we1215053460/article/details/78806669

本文介绍了一种使用二分法求解特定形式方程的数值解法，并通过C语言实现。该方法适用于在限定区间[0,1]内寻找使方程等于0的x值，针对不同参数组进行多次测试。

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

Solve the equation:
p ∗ e
−x + q ∗ sin(x) + r ∗ cos(x) + s ∗ tan(x) + t ∗ x
2 + u = 0
where 0 ≤ x ≤ 1.
Input
Input consists of multiple test cases and terminated by an EOF. Each test case consists of 6 integers in
a single line: p, q, r, s, t and u (where 0 ≤ p, r ≤ 20 and −20 ≤ q, s, t ≤ 0). There will be maximum
2100 lines in the input file.
Output
For each set of input, there should be a line containing the value of x, correct up to 4 decimal places,
or the string ‘No solution’, whichever is applicable.
Sample Input
0 0 0 0 -2 1
1 0 0 0 -1 2
1 -1 1 -1 -1 1
Sample Output
0.7071
No solution

0.7554

二分枚举x

#include<stdio.h>
#include<math.h>

int p,q,r,s,t,u;

double check(double x)
{
    return p*exp(-x)+q*sin(x)+r*cos(x)+s*tan(x)+t*x*x+u;
}

int main()
{
    while(~scanf("%d%d%d%d%d%d",&p,&q,&r,&s,&t,&u))
    {
        double high=1,low=0,mid;
        while(high-low>1e-8)
        {
            mid=(high+low)/2;
            if(check(mid) > 0)
                low=mid;
            else
                high=mid;
        }
        if(fabs(check(mid)-0.0)<1e-6)
            printf("%.4f\n",mid);
        else
            printf("No solution\n");
    }
    return 0;
}