题目:F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x。输入T组数据,每个代表y的值。找出0到100间的最小解。保留四位小数。
思路:依旧是典型二分法题,直接套模板。不解释。
代码:#include<iostream>
#include<stdio.h>
#include<cmath>
using namespace std;
double f(double x,double y){
return 6*pow(x,7)+8*pow(x,6)+7*pow(x,3)+5*pow(x,2)-y*x;
}
int main(){
int t;
cin>>t;
while(t--){
int y;
cin>>y;
double min;
double low=0,high=100,mid,mmid;
while(high-low>=1.0e-7){
mid=(high+low)/2;
mmid=(high+mid)/2;
if(f(mid,y)<f(mmid,y)){
high=mmid;
mmid=mid;
min=f(mid,y);
}else if(f(mid,y)>f(mmid,y)){
low=mid;
min=f(mmid,y);
}else{
low=mid;
high=mmid;
}
}
printf("%0.4lf\n",min);
}
return 0;
}