hdu 2199 Can you solve this equation?

Can you solve this equation? 函数求导成单调，采用二分法
添加链接描述
老师做法1：二分，精度控制

#include <bits/stdc++.h>
using namespace std;
// 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6
#define f(x) (x*(x*(x*(x*8+7)+2)+3)+6)
double binSearch(double l, double r, double val){
    double mid;
    while(r - l > 1e-7){//这里精度控制
        mid = (l+r)/2;
        if(f(mid) > val) r = mid;
        else l = mid;
    }
    return (l+r)/2;
}
int main(){
    int T;
    double y, f0 = f(0.0), f100 = f(100.0);
    scanf("%d", &T);
    while(T--){
        scanf("%lf", &y);
        if(y < f0 || y > f100){
            printf("No solution!\n");
            continue;
        }
        printf("%.4f\n", binSearch(0, 100, y));
    }
    return 0;
}

老师做法2：二分，多次迭代

#include <bits/stdc++.h>
using namespace std;
// 8*x^4 + 7*x^3 + 2*x^2 + 3*x +6 
#define f(x) (x*(x*(x*(x*8+7)+2)+3)+6)
double solve(double l, double r, double val)eng{
    double mid;
    for(int i = 1; i <= 100; i++){//进行100次，必定会更准确。
        mid = (l+r)/2;
        if(f(mid) > val) r = mid;
        else l = mid;
    }
    return (l+r)/2;
}
int main(){
    int T;
    double y, f0 = f(0.0), f100 = f(100.0);
    scanf("%d", &T);
    while(T--){
        scanf("%lf", &y);
        if(y < f0 || y > f100){
            printf("No solution!\n");
            continue;
        }
        printf("%.4f\n", solve(0, 100, y));
    }
    return 0;
}

（与2899相比得出看见函数思考求导看1.是否单调，单调就用二分法 2.显凸性用三分法）