# POJ_1129 pie 解题报告

J - Pie
Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

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.

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 10−3.

Sample Input

3
3 3
4 3 3
1 24
5
10 5
1 4 2 3 4 5 6 5 4 2

Sample Output

25.1327
3.1416
50.2655

#include<iostream>
#include <cmath>
using namespace std;
int A,B;
double V[10000];//用于记录每个饼的体积。
double pi = acos ( -1.0 );//精确求pi的值。
int test(double mid)//二分的测试过程。
{
int num=0;
int i;
for(i=0;i<A;i++)
{
num+=V[i]/mid;//求饼可以分成的总人数.
}
if(num>B)
return 1;
else
return 0;
}
int main()
{
int i,N,r;
double v,R,L,mid;
scanf("%d",&N);
while(N--)
{
v=0;
scanf("%d%d",&A,&B);
for(i=0;i<A;i++)
{
scanf("%d",&r);
V[i]=r*r*pi;
v+=V[i];
}
L=0;
R=v/(B+1);//计算每个人可分到的最大体积数。
while((R-L)>1e-6)
{
mid=(R+L)/2;
if(test(mid)==1)
L=mid;
else
R=mid;
}
printf("%.4lf\n",mid);
}
return 0;
}

• 本文已收录于以下专栏：

## 二分查找——D:Pie 解题报告

Pie Description My birthday is coming up and traditionally I'm serving pie. Not just one pie, no...
• xp731574722
• 2016年07月22日 14:13
• 357

## Pie解题报告

My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N ...
• xieqinghuang
• 2012年03月25日 20:39
• 281

## poj_1129

• ThinkingLion
• 2015年03月20日 13:28
• 109

## 【Jason's_ACM_解题报告】Pie

Pie 解题报告
• DoriLeigh
• 2015年02月04日 11:33
• 185

## POJ 3122 Pie解题报告

Description My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I hav...
• HJ_Air
• 2012年03月16日 13:38
• 392

## POJ-1129 Pie 解题报告

Description My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I h...
• angle555945
• 2012年03月11日 23:29
• 1161

## J - Pie解题报告（黄杰）

J - Pie Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit Stat...
• CSUST_ACM
• 2012年03月21日 13:36
• 3564

## linux PIE 程序

• zat111
• 2015年07月03日 10:47
• 1547

## 绕过android 5.0以上的pie机制

• kangear
• 2017年09月21日 00:09
• 541

## 软件测试——PIE模型

1、Bug的类型： Fault：静态存在于软件中的缺陷，如code写错了。 Error：软件运行时，运行到fault触发产生错误的中间状态。 Failure：Error传...
• liujing96
• 2017年10月08日 21:48
• 264

举报原因： 您举报文章：POJ_1129 pie 解题报告 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)