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

题意：根据题目中的公式。求出0-1区间中。x的解。。

思路：由题目中的已知条件不难推出。那个公式在x属于[0，1]时是单调递减的。。然后进行二分法。找出x

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

double p, q, r, s, t, u;
double x1, x2;
int judge;
double solve(double x) {
	return p * exp(-x) + q * sin(x) + r * cos(x) + s * tan(x) + t * x * x + u;
}
int main() {
	while (~scanf("%lf%lf%lf%lf%lf%lf", &p,&q, &r, &s, &t, &u)) {
		x1 = 0; x2 = 1; judge = 1;
		while (fabs(x1 - x2) > 1e-9) {
			double x = (x1 + x2) / 2;
			if (solve(x1) > 0 && solve(x2) > 0 || solve(x1) < 0 && solve(x2) < 0) {
				printf("No solution\n");
				judge = 0;
				break;
			}
			if (solve(x) < 0)
				x2 = x;
			if (solve(x) > 0)
				x1 = x;
		}
		if (judge)
			printf("%.4lf\n", x1);
	}
	return 0;
}