模拟退火法求函数最值：

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const double eps = 1e-8;
double y;
double func(double x) {
    return 6 * pow(x, 7.0) + 8 * pow(x, 6.0) + 7 * pow(x, 3.0) + 5 * pow(x, 2.0) - y * x;
}
double solve() {
    double T = 100;
    double delta = 0.98;
    double x = 50.0;
    double now = func(x);
    double ans = now;
    while (T > eps) {
        int f[2] = { 1,-1 };
        double newx = x + f[rand() % 2] * T;
        if (newx >= 0 && newx <= 100) {
            double next = func(newx);
            ans = min(ans, next);
            if (now - next < eps) { x = newx; now = next; }
        }
        T *= delta;
    }
    return ans;
}
int main() {
    int cas;
    scanf_s("%d", &cas);
    while (cas--) {
        scanf_s("%lf", &y);
        printf("%.4f\n", solve());
    }
}