二分法查找基础
来源:互联网 发布:阿里云域名备案 编辑:程序博客网 时间:2024/05/21 17:51
杭电2199Can you solve this equation?
Problem Description
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.
Input
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);
Output
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.
Sample Input
2
100
-4
Sample Output
1.6152
No solution!
这题是二分法查找。直接套模板
#include<stdio.h>#include<math.h>double f(double x){ return 8*pow(x,4.0)+7*pow(x,3.0)+2*pow(x,2.0)+3*x+6;}int main(){ int n; double m, l, ll, ans, mm; scanf("%d",&n); while(n--){ scanf("%lf",&m); l = 0; ll = 100; if(m >= f(0) && m <= f(100)){//外界条件 ; while(ll-l > 1e-9){//精确度 ; mm = (ll + l)/2; double ans = f(mm); if(ans > m){//二分法; ll = mm-1e-9; } else{ l = mm+1e-9; } } printf("%.4lf\n",(ll+l)/2); } else printf("No solution!\n"); } return 0 ;}
1 0
- 【基础算法】二分法查找
- 二分法查找基础
- Python基础----二分法查找
- java基础二分法查找
- 数据结构基础_二分法查找
- Java基础必备---二分法查找
- Java语言基础-查找算法-二分法查找
- Java基础复习 查找算法之二分法
- Java语言基础-12.二分法查找
- 基础算法——查找(二分法)(python)
- 12.java语言基础-查找算法-二分法查找
- 二分法查找
- 二分法查找
- 二分法查找
- 二分法查找
- 二分法查找
- 二分法查找
- 二分法查找
- Android:使用MuPdf开源库阅读PDF文件
- TCP/IP——TCP协议中提高网络利用率的机制
- UVALIVE 4452(2-SAT变形)
- Android插件化开发笔记(一)
- 二叉树后序遍历算法
- 二分法查找基础
- MAC OS下OpenSSL生成私钥和公钥以及RSA加密
- U3D 游戏引擎之游戏架构脚本该如何来写
- 数据结构(1)队列(C语言版)
- [Express-02] 路由配置
- python爬虫代码简化1
- Trie(字典树)的学习
- MD5的简单学习,钥匙串
- Android_eventbus第三方库_EventBus的使用