HDU 2899(搜索题,二分)
来源:互联网 发布:ok组合三连冠时期数据 编辑:程序博客网 时间:2024/05/16 00:54
Strange fuction
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 80 Accepted Submission(s): 62
Problem Description
Now, here is a fuction:
F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 <= x <=100)
Can you find the minimum value when x is between 0 and 100.
F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 <= x <=100)
Can you find the minimum value when x is between 0 and 100.
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 only one real numbers Y.(0 < Y <1e10)
Output
Just the minimum value (accurate up to 4 decimal places),when x is between 0 and 100.
Sample Input
2100200
Sample Output
-74.4291-178.8534
利用函数的单调性求极值
f(x)'=g(x)-y
- HDU 2899(搜索题,二分)
- HDU 2199(搜索题,二分)
- HDU 2141(搜索题,二分)
- HDU 2289(搜索题,二分、几何)
- HDU 1969(搜索题,二分)
- HDU 2446(搜索题,二分)
- HDU 1551(搜索题,二分)
- HDU 2289 Cup (二分搜索)
- hdu 2141 二分搜索
- hdu 1075 二分搜索
- hdu 2337 Escape from Enemy Territory (预处理+二分+搜索)
- hdu 1795(欧拉函数+二分搜索)
- 题解: HDU 4004 The Frog's Games (二分搜索)
- hdu-3943[数位dp(记忆化搜索)+二分]
- hdu 5682 zxa and leaf (二分+搜索)
- hdu-2141Can you find it?(二分搜索求和)
- 简单搜索入门(二):二分答案 HDU 5248
- hdu 2899(方程题,二分查找)
- findfile用法
- 我终于有了csdn帐号了
- Note 716604 - Access to Sun J2SE and recommended J2SE options
- BM模式匹配算法-实现(C语言)
- Alert 用法
- HDU 2899(搜索题,二分)
- 21个演示展示强大的jQuery特效
- python 3.1下的字符串转换(备忘)
- zoj 3355 Football Gambling I(zoj7月月赛)
- Visual Studio 2005 安装文件制作
- [转]document.getElementsByClassName的理想实现]
- zoj 3359 Penalties Kick(zoj7月月赛)
- C语言:内存字节对齐详解(转载)
- 【转】JS日历控件