10341 - Solve It UVA

Solve It

Input: standard input

Output: standard output

Time Limit: 1 second

Memory Limit: 32 MB

Solve the equation:
        p*e^-x + q*sin(x) + r*cos(x) + s*tan(x) + t*x² + 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 (where0 <= 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 upto 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

首先做题前得知道该函数是一个单调递减的函数：

然后利用二分的方法不断循环；

然后利用while循环n次可以不断逼近x的值此处的n值可以为比30更大的数：

#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <stdlib.h>
using namespace std;
int main()
{
    int  p,q,r,s,t,u;
    while(scanf("%d%d%d%d%d%d",&p,&q,&r,&s,&t,&u)!=EOF)
    {
        double R = 1;
        double L = 0;
        int n = 0;
        double mid;
        while(n<30)
        {
            mid = (L+R)/2;
             if(p*exp(-mid) + q*sin(mid) + r*cos(mid) + s*tan(mid) + t*mid*mid + u>0)
                L=mid;
              else//或者else if(p*exp(-mid) + q*sin(mid) + r*cos(mid) + s*tan(mid) + t*mid*mid + u<0)
                R=mid;
            n++;
        }
        if(fabs(p*exp(-mid) + q*sin(mid) + r*cos(mid) + s*tan(mid) + t*mid*mid + u)<0.0000001)
            printf("%.4lf\n",mid);
        else
            printf("No solution\n");
    }
    return 0;
}