poj1064Cable master【二分】
来源:互联网 发布:知乎 北京 裁缝店 编辑:程序博客网 时间:2024/06/05 04:48
Language:
Cable master
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 32143 Accepted: 6881
Description
Inhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It was decided to connect computers for the contestants using a "star" topology - i.e. connect them all to a single central hub. To organize a truly honest contest, the Head of the Judging Committee has decreed to place all contestants evenly around the hub on an equal distance from it.
To buy network cables, the Judging Committee has contacted a local network solutions provider with a request to sell for them a specified number of cables with equal lengths. The Judging Committee wants the cables to be as long as possible to sit contestants as far from each other as possible.
The Cable Master of the company was assigned to the task. He knows the length of each cable in the stock up to a centimeter,and he can cut them with a centimeter precision being told the length of the pieces he must cut. However, this time, the length is not known and the Cable Master is completely puzzled.
You are to help the Cable Master, by writing a program that will determine the maximal possible length of a cable piece that can be cut from the cables in the stock, to get the specified number of pieces.
To buy network cables, the Judging Committee has contacted a local network solutions provider with a request to sell for them a specified number of cables with equal lengths. The Judging Committee wants the cables to be as long as possible to sit contestants as far from each other as possible.
The Cable Master of the company was assigned to the task. He knows the length of each cable in the stock up to a centimeter,and he can cut them with a centimeter precision being told the length of the pieces he must cut. However, this time, the length is not known and the Cable Master is completely puzzled.
You are to help the Cable Master, by writing a program that will determine the maximal possible length of a cable piece that can be cut from the cables in the stock, to get the specified number of pieces.
Input
The first line of the input file contains two integer numb ers N and K, separated by a space. N (1 = N = 10000) is the number of cables in the stock, and K (1 = K = 10000) is the number of requested pieces. The first line is followed by N lines with one number per line, that specify the length of each cable in the stock in meters. All cables are at least 1 meter and at most 100 kilometers in length. All lengths in the input file are written with a centimeter precision, with exactly two digits after a decimal point.
Output
Write to the output file the maximal length (in meters) of the pieces that Cable Master may cut from the cables in the stock to get the requested number of pieces. The number must be written with a centimeter precision, with exactly two digits after a decimal point.
If it is not possible to cut the requested number of pieces each one being at least one centimeter long, then the output file must contain the single number "0.00" (without quotes).
If it is not possible to cut the requested number of pieces each one being at least one centimeter long, then the output file must contain the single number "0.00" (without quotes).
Sample Input
4 118.027.434.575.39
Sample Output
2.00
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>using namespace std;int num[10010];bool judge(int mid,int n,int k){int ans=0;if(mid==0)return false;for(int i=0;i<n;++i){ans+=num[i]/mid;}return ans>=k;}int main(){int n,i,j,k;while(scanf("%d%d",&n,&k)!=EOF){double len;int maxn=0;for(i=0;i<n;++i){scanf("%lf",&len);num[i]=(int)(len*100);maxn=max(maxn,num[i]);}bool flag=false;int l=0,r=maxn,ans;while(l<=r){int mid=(l+r)>>1;if(judge(mid,n,k)){ans=mid;flag=true;l=mid+1;}else {r=mid-1;}}if(flag){printf("%.2lf\n",ans*0.01);}else {printf("0.00\n");}}return 0;}
0 0
- poj1064Cable master【二分】
- POJ1064Cable master(二分, 精度控制)
- hdu1551Cable master(二分,精度)
- HDU1551:Cable master(二分)
- Cable master 二分
- POJ1064 Cable master(二分)
- POJ1064 Cable master 二分
- hdu1551Cable master(二分*)
- POJ1064 Cable master 二分
- POJ1064 Cable master(二分)
- HDU1551:Cable master(二分)
- HDU1551 Cable master(二分)
- POJ1064 Cable master(二分)
- Cable master 小数二分
- HDU1551Cable master(二分)
- HDU1551:Cable master(二分)
- HDU1551:Cable master(二分)
- HDU1551:Cable master(二分)
- Android中常用单位(dpi、px、dp、sp)
- 应用层—域名系统DNS
- iOS开发new与alloc/init的区别
- x265探索与研究(一):x265下载安装与配置
- 命令行方式
- poj1064Cable master【二分】
- 简单Linux C线程池
- 数据解析
- windows下socket开发tcp程序 简单例子
- DNS服务器
- Error: cannot mount filesystem: No such device
- Android的CheckBox复选框
- Linux下DNS服务器的配置
- HDU 3398 String(数论)