先对方程求一次导,然后再看系数-20 <= q,s,t <= 0,题目把所有正的项前系数都给弄成负的了,故求导的值是负的,故单调递减,0=<x<=1,就可以二分了。
AC代码:
#include<cstdio>
#include<ctype.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<stack>
#include<cmath>
#include<queue>
#include<set>
#include<ctime>
using namespace std;
#define eps 1e-10
int sig(double x){return (x>eps)-(x<-eps);}
int p,q,r,s,t,u;
double fun(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))
{
if(fun(0) < 0 || fun(1) > 0)
{
printf("No solution\n");
continue;
}
double x=0,y=1,ans;
while(y-x > eps)
{
double m = x+(y-x)/2;
ans = fun(m);
if(sig(ans) > 0) x = m;
else y = m;
}
printf("%.4lf\n",x);
}
return 0;
}