NYOJ 503 二分
2012-03-26 09:50 javaspring 阅读(170) 评论(0) 收藏 举报直接用二分求答案就可以了,,题目:
解方程
时间限制:1000 ms | 内存限制:65535 KB
难度:3
- 描述
-
Now,given the equation 8*x^4 - 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100;
Now please try your lucky.- 输入
- The first line of the input contains an integer T(1<=T<=100) which means the number of test cases. Then T lines follow, each line has a real number Y (fabs(Y) <= 1e10);
- 输出
- For each test case, you should just output one real number(accurate up to 4 decimal places),which is the solution of the equation,or “No solution!”,if there is no solution for the equation between 0 and 100.
- 样例输入
-
2 100 -4
- 样例输出
-
2.0422 No solution!
#include <iostream>
#include <string.h>
#include <cstdio>
#include <cmath>
using namespace std;
#define mmin 1e-10
double x,y;
double mi(double s,int num){
double p=1.000;
for(int i=1;i<=num;++i)
p*=s;
return p;
}
void binary_mi(){
double lt=0.00,rt=100.00;
while(rt-lt>mmin){
double mid=(lt+rt)/2.0;
double ss=8*mi(mid,4)-7*mi(mid,3)+2*mi(mid,2)+3*mi(mid,1)+6;
if(ss<y){
lt=mid;
}
else if(ss>y){
rt=mid;
}
}
printf("%.4lf\n",(lt+rt)/2.0);
return;
}
void fun(){
if(y<6||y>793020306){
printf("No solution!\n");
}
else{
binary_mi();
}
}
int main(){
// freopen("11.txt","r",stdin);
int numcase;
scanf("%d",&numcase);
while(numcase--){
x=0.0;
scanf("%lf",&y);
fun();
}
return 0;
}
浙公网安备 33010602011771号