hdoj2199Can you solve this equation?
2016-07-27 18:56
302 查看
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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);
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
2
100
-4
[align=left]Sample Output[/align]
1.6152
No solution!
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.
[align=left]Input[/align]
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);
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
2
100
-4
[align=left]Sample Output[/align]
1.6152
No solution!
#include<cstdio> #include<algorithm> #include<string.h> using namespace std; double fun(double x) { return 8*x*x*x*x+7*x*x*x+2*x*x+3*x+6; } int main() { double y,mid; int n; scanf("%d",&n); while(n--) { scanf("%lf",&y); if(y<6||y>fun(100)) printf("No solution!\n"); else { double l=1,r=100; while(r-l>1e-8) { mid=(l+r)/2.0; if(y>fun(mid)) { l=mid; } else { r=mid; } } printf("%.4lf\n",mid); } } }
相关文章推荐
- 华为oj--中级--购物单
- spring 学习之路——spring 初接触
- Mysql学习总结(9)——MySql视图原理讲解与使用大全
- 7.25笔记(history,man)
- 【c语言之break的作用】
- Spring编程式事务管理(xml注入)
- 分享一个用javafx写的cocos2dx命令行小工具
- OpenSearch 简单学习
- POJ2236 Wireless Network
- mdb
- (C)程序控制块(TCB)
- Mysql学习总结(8)——MySql基本查询、连接查询、子查询、正则表达查询讲解
- Nginx 项目部署和配置
- 选择排序
- HBase Phoenix 机制
- JVM类加载时经典的双亲委派模型
- 计算机上正在运行的句柄、线程、进程分别是什么意思?
- CAP理论
- bzoj 2561: 最小生成树
- mysql全解