P4526 【模板】自适应辛普森法2

 #include <bits/stdc++.h>

 using namespace std;

 const double eps = 1e-;

 double a;

 inline double f(double x) {

     return pow(x,a/x-x);

 }

 inline double simpson(double l, double r) {

     double mid = (l+r)/;

     return (f(l)+*f(mid)+f(r))*(r-l)/;

 }

 inline double asr(double l, double r, double eps, double ans) {

     double mid = (l+r)/;

     double ll = simpson(l,mid), rr = simpson(mid,r);

     if (fabs(ll+rr-ans) <= *eps) return ll+rr+(ll+rr-ans)/;

     return asr(l,mid,eps/,ll)+asr(mid,r,eps/,rr);

 }

 inline double asr(double l, double r, double eps) {

     return asr(l,r,eps,simpson(l,r));

 }

 int main() {

     scanf("%lf",&a);

     if (a < ) puts("orz");

     else printf("%.5f\n",asr(eps,20.0,eps));

     return ;

 }