杭电oj1969 pie(二分法)
来源:互联网 发布:五笔 86 98 知乎 编辑:程序博客网 时间:2024/06/05 17:02
Pie
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6614 Accepted Submission(s): 2506
Problem Description
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.
---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 10^(-3).
Sample Input
33 34 3 31 24510 51 4 2 3 4 5 6 5 4 2
Sample Output
25.13273.141650.2655
题意:有m+1个人和n个饼,现在分这些饼,要求每个饼的体积一样(每个饼都是高为1的柱体,所以说求体积就是求底面积)。问你能分的最大体积(就是底面积)。
#include<stdio.h>#include<math.h>#define PI acos(-1.0)//定义PI的固定格式记死!!!!! double a[10010];//全局变量 int n,m;int fun(double x){int i,s=0;for(i=0;i<n;i++){s=s+(int)(a[i]/x) ;//把每个pie的体积都除以要找的mid }if(s>=m)//说明mid小了 l=mid return 1;elsereturn 0;}int main(){int T,i,R;double sum,max,l,mid,r;scanf("%d",&T);while(T--){scanf("%d%d",&n,&m);//有n个饼,m个朋友 m=m+1;sum=0;for(i=0;i<n;i++){scanf("%d",&R);a[i]=(double)PI*R*R;//把每个pie的体积存到数组里 sum=sum+a[i];}max=sum/m;l=0;r=max;while((r-l)>1e-6)//精度要大于1e-6 {mid=(l+r)/2;if(fun(mid))l=mid;elser=mid;}printf("%.4lf\n",l);//输出l }return 0;}
0 0
- 杭电oj1969 pie(二分法)
- 杭电 1969 Pie 二分法 附翻译 解题思路
- Pie (二分法)
- (POJ3122)Pie <二分法>
- Pie(二分法)
- 【HDU1969】Pie(二分法)
- uva - 12097 - Pie(二分法)
- poj 3122 Pie(二分法)
- 【杭电oj】1969 - Pie(二分)
- 杭电-1969 Pie(二分)
- 杭电1969-Pie
- 【杭电1969】Pie
- 二分法-Pie
- 二分法--Pie
- 杭电二分法NO1064
- hdu 1969 Pie (二分法+贪心)
- poj3122 Pie 二分法
- PIE(二分法分饼)
- Iterator
- xUbuntu安装笔记
- A001-课程介绍
- jetty安装
- ping工作原理
- 杭电oj1969 pie(二分法)
- Why Coding Like this -------Reduce揭秘
- hdu 1241 Oil Deposits
- 【转】derby+hibernate+spring
- ZOJ 2100--Seeding【DFS】
- twisted的FTPRealm解读
- Poj Asteroids(最小顶点覆盖)
- html刷新和定时跳转页面
- hdu 1175 连连看(DFS)