uva 10341-Solve It 二分求值

Problem F

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(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 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

代码：

#include <stdio.h>
#include <math.h>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring> 
#include <cmath>
#define setbit(x,y) x|=(1<<(y)) //将X的第Y位置1
#define clrbit(x,y) x&=~(1<<(y)) //将X的第Y位清0
#define sf scanf
#define pf printf
#define INF 1 << 29
#define eps 1e-6
const double PI = acos(-1.0);               
#define lint __int64
#define LL long long 
#define MAX 1e9 + 7
#define maxn 10005
//101^110=011 异或
#define ULLint unsigned long long //2^64-1>1.8*10^19 
#define clr(x) memset(x, 0, sizeof(x))
#define Clr(x) memset(x, -1, sizeof(x))

using namespace std;

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

int main() {
    while(scanf("%lf%lf%lf%lf%lf%lf",&p, &q, &r, &s, &t, &u) != EOF) {
        double left = 0, rig = 1;
        while(rig - left > 1e-10) {
            double mid = (left + rig) / 2;
            if(p * exp(-mid) + q * sin(mid) + r * cos(mid) + s * tan(mid) + t * mid * mid + u > 0) left=mid;
            else rig = mid;
        }
        if(fabs(p * exp(-rig) + q * sin(rig) + r * cos(rig) + s * tan(rig) + t * rig * rig + u) < 1e-6) 
			pf("%.4f\n", rig);
        else pf("No solution\n");
    }
    return 0;
}