HDOJ 2199 Can you solve this equation? (二分)
2015-08-20 17:20
323 查看
Can you solve this equation?
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13402 Accepted Submission(s): 5977
[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!
注 - 此题为: HDOJ 2199 Can you solve this equation? (二分)
二分法,注意精度
已AC代码:
#include<cstdio> double fy(double x) { return 8*x*x*x*x + 7*x*x*x + 2*x*x + 3*x + 6; } double abs(double x) { if(x<0) x=-1*x; return x; } int main() { int T; scanf("%d",&T); while(T--) { double y; scanf("%lf",&y); if(y<fy(0)||y>fy(100)) { printf("No solution!\n"); continue; } double mid,left=0,right=100; while(right-left>1e-10) // 二分 { mid=(left+right)/2; if(abs(fy(mid)-y)<1e-10) break; if(fy(mid)>y) right=mid; else left=mid; } printf("%.4f\n",mid); } return 0; }
相关文章推荐
- 使用 c++ 与 subverison 编写 Commiter 小工具 提交 xxx.xml文件中指定的文件
- DOM(三)-03-(示例-性格测试)
- J-5 Java语言基础
- recyclerview的基本用法(一)
- DOM(三)-02-(示例-调查问卷)
- 单例的完整写法
- 对于公司网站架构的一些感慨~
- Android L 5.0版本获取topActivity的方法
- iOS时间处理之时间对比 by Nicky.Tsui
- JPA & Hibernate 注解
- 调试lldb命令常用
- Java jdbc事物回滚处理,纯手工打造
- twistd内置服务
- dilate函数
- 40个高质量Java开发者博客
- DOM(三)-01-(示例-邮件列表)
- 读取bq26500电池电量 Driver
- Oracle自增序列
- struts2用户是否登录拦截器,拦截之后异步跳转到登录页面
- 【转】Eclipse配置Struts2问题:ClassNotFoundException: org...dispatcher.ng.filter.StrutsPrepareAndExecuteFilter