poj 3122 二分
来源:互联网 发布:桌面日历记事本软件 编辑:程序博客网 时间:2024/06/05 18:20
My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my party and each of them gets a piece of pie. This should be one piece of one pie, not several small pieces since that looks messy. This piece can be one whole pie though.
My friends are very annoying and if one of them gets a bigger piece than the others, they start complaining. Therefore all of them should get equally sized (but not necessarily equally shaped) pieces, even if this leads to some pie getting spoiled (which is better than spoiling the party). Of course, I want a piece of pie for myself too, and that piece should also be of the same size.
What is the largest possible piece size all of us can get? All the pies are cylindrical in shape and they all have the same height 1, but the radii of the pies can be different.
My friends are very annoying and if one of them gets a bigger piece than the others, they start complaining. Therefore all of them should get equally sized (but not necessarily equally shaped) pieces, even if this leads to some pie getting spoiled (which is better than spoiling the party). Of course, I want a piece of pie for myself too, and that piece should also be of the same size.
What is the largest possible piece size all of us can get? All the pies are cylindrical in shape and they all have the same height 1, but the radii of the pies can be different.
Input
One line with a positive integer: the number of test cases. Then for each test case:
- One line with two integers N and F with 1 ≤ N, F ≤ 10 000: the number of pies and the number of friends.
- One line with N integers ri with 1 ≤ ri ≤ 10 000: the radii of the pies.
Output
For each test case, output one line with the largest possible volume V such that me and my friends can all get a pie piece of size V. The answer should be given as a floating point number with an absolute error of at most
33 34 3 31 24510 51 4 2 3 4 5 6 5 4 2
Sample Output
25.13273.141650.2655
pi的精度真是揪心啊!!!
#include <iostream>#include <algorithm>#include <cstdio>#define esp 10e-10#define pi 3.141592653589793using namespace std;int main(){ int m; scanf("%d",&m); while(m--) { int n,f,i; int a[10050]; scanf("%d %d",&n,&f); //if(n<1||f<1) // break; for(i=0; i<n; i++) scanf("%d",&a[i]); int q=*max_element(a,a+n); double mid,high=q,low=0.0; while((high-low)>esp) { mid=(high+low)/2; int count=0; for(i=0; i<n; i++) count+=(int)((a[i]*a[i])/(mid*mid)); if(count>f) low=mid; else high=mid; } printf("%.4lf\n",mid*mid*pi); } return 0;}
0 0
- POJ 3122 Pie 二分
- POJ 3122 Pie 二分
- poj-3122-二分
- POJ 3122 二分查找
- poj 3122(二分)
- poj 3122 Pie (二分)
- poj 3122 二分
- Pie - POJ 3122 二分
- POJ 3122 Pie(二分)
- POJ 3122pie(二分)
- POJ 3122(二分)
- POJ 3122 pie 二分
- [poj 3122] Pie 二分
- POJ 3122 二分
- poj 3122 二分
- POJ Pie 3122 (二分)
- POJ 3122 - Pie(二分)
- POJ 3122(二分算法)
- 编译安卓源码的注意事项
- Perform Two Phase Commits
- 如何判断一个正整数数x是否为2的幂
- 最短路径问题
- 【POJ3264】 Charm Bracelet
- poj 3122 二分
- C++读书清单
- 安卓cpu调速器和IO策略
- 不要把自己定位的太高
- UML统一建模语言
- 快速排序C实现(阿里巴巴 2012年笔试题)
- python学习笔记 with语句
- 线段树练习 2(线段树是个啥玩意啊,还是个大师的题,我感觉青铜都不到)
- PHP数学运算和日期相关