Can you solve this equation?
2015-07-30 15:07
288 查看
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 12908 Accepted Submission(s): 5774[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!#include<stdio.h> double m; double f(double x) { return 8*x*x*x*x+7*x*x*x+2*x*x+3*x+6; } int main() { int n; scanf("%d",&n); while(n--) { double l,r,s,h; scanf("%lf",&m); if(f(0)<=m&&f(100)>=m) { l=0,r=100; while(r-l>1e-7) { h=(r+l)/2; s=f(h); if(s>m) r=h; else l=h; } printf("%.4lf\n",(r+l)/2); } else printf("No solution!\n"); } return 0; }
相关文章推荐
- nyoj35表达式求值
- 链表 C++描述
- eclipse的快捷键--收藏
- PARSEC测试集的应用领域
- oracle服务介绍
- 从escapeshellcmd bypass说起到宽字节注入
- 141.Linked List Cycle (判断一个单链表是否有环)
- NYOJ 68
- Android线程调度机制
- 通过wifi离线推广ios app
- 杭电1213 How Many Tables(并查集找根节点)
- SQL之CONVERT(varchar(100), GETDATE(), 0)
- MySQL的语句执行顺序
- fresh in werkzeug
- python eval的常见错误封装及利用原理
- Fibonacci的【兔子数列】 以及 【狐狸找兔子】的问题 及 算法!
- DHCP服务器 server 2003 到 server 2012 迁移 (二)
- python 安全编码&代码审计
- 如何让人的一生价值最大
- Android adb获取event