Pie
来源:互联网 发布:校园网络安全教育讲座 编辑:程序博客网 时间:2024/06/06 00:30
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.
---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.
33 34 3 31 24510 51 4 2 3 4 5 6 5 4 2
25.13273.141650.2655
#include<stdio.h>
#define PI 3.14159265359
int main()
{
int t,sum,i,rr[1000005];
double maxr,maxv,r,l,mid;
int n,f; //n:馅饼 f:朋友。
scanf("%d",&t);
while(t--)
{
maxr=0;
sum=0;
scanf("%d%d",&n,&f);
for(i=0;i<n;i++)
scanf("%d",&rr[i]);
for(i=0;i<n;i++)
if(maxr<rr[i])
maxr=rr[i];
for(i=0;i<n;i++)
rr[i]=rr[i]*rr[i];
r=maxr*maxr;
l=0;
while(r-l>1e-6)
{
mid=(r+l)/2;
sum=0;
for(i=0;i<n;i++)
{
sum=sum+(int)(rr[i]/mid);
}
if(sum<f+1)
r=mid;
if(sum>=f+1) /*恰好可以把馅饼分成跟人数相等时
不一定是馅饼面积最大的情况,所
以要继续在右区间继续分。*/
l=mid;
}
printf("%.4lf\n",l*PI);
}
return 0;
}
- Pie
- Pie
- pie
- Pie
- Pie
- PIE
- Pie
- Pie
- Pie
- Pie
- Pie
- Pie
- pie
- Pie
- Pie
- Pie
- Pie
- Pie
- SSD(Single Shot MultiBox Detector)笔记
- jsp 网站 mysql 数据库连接 tomcat 服务器配置server
- Docker-ce+Ubuntu 16.04环境配置
- 简单写个好理解的Builder设计模式
- sql时间参数输出
- Pie
- 数据结构与算法分析(Java语言描述)(30)—— 有权图的实现
- HDFS实现其高可靠性的策略及机制
- freemarker 模版静态化
- “敲代码”学编程的正确方式
- 《HTTP权威指南》学习笔记(1)第1章HTTP概述(关键词:计算机网络/HTTP)
- 【Tensorflow slim】 slim.arg_scope的用法
- Android L版本上codegen.dws文件的路径.docx
- 木乃伊迷宫