HDU1551Cable master(二分)
来源:互联网 发布:java base32编码方法 编辑:程序博客网 时间:2024/05/19 01:30
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.
Input
The input consists of several testcases. The first line of each testcase contains two integer numbers 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 centimeter and at most 100 kilometers in length. All lengths in the input are written with a centimeter precision, with exactly two digits after a decimal point.
The input is ended by line containing two 0's.
Output
For each testcase write to the output 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 must contain the single number "0.00" (without quotes).
Sample Input
4 11
8.02
7.43
4.57
5.39
0 0
Sample Output
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.
Input
The input consists of several testcases. The first line of each testcase contains two integer numbers 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 centimeter and at most 100 kilometers in length. All lengths in the input are written with a centimeter precision, with exactly two digits after a decimal point.
The input is ended by line containing two 0's.
Output
For each testcase write to the output 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 must contain the single number "0.00" (without quotes).
Sample Input
4 11
8.02
7.43
4.57
5.39
0 0
Sample Output
2.00
题意:给你n段网线,你可以裁它们,再告诉你总共有多少人,每人需要一条网线,问你符合题意的裁法,最短网线至多多长。
思路:用二分法判断,每次取一半,知道符合题意为止。注意添加精度。
代码:
#include<stdio.h>#include<iostream>#include<algorithm>#include<math.h>#define xps 1e-12using namespace std;int n,k;double l[100010];bool judge(double x){int sum=0;for(int i=0;i<n;i++){sum+=(int)(l[i]/x);if(sum>=k)return true;}return sum>=k;} int main(){while(cin>>n>>k,n!=0&&k!=0){int p=100;double ans=0.0,mid;for(int i=0;i<n;i++){cin>>l[i];}double s=0.0,e=100000.0;while(p--){mid=(s+e)/2.0;if(judge(mid)){ans=mid;s=mid+xps;}elsee=mid-xps;}printf("%.2lf\n",ans);}return 0;}
0 0
- HDU1551Cable master(二分)
- hdu1551Cable master(二分,精度)
- hdu1551Cable master(二分*)
- hdu1551Cable master
- Cable master(二分)
- POJ1064:Cable master(二分)
- POJ1064 -- Cable master(二分)
- poj1064(二分)Cable master
- Cable master(二分查找)
- hdoj 1551 Cable master(二分)
- POJ - Cable master (二分搜索)
- poj-1064Cable master(二分)
- poj1064 Cable master(二分求解)
- POJ 1064 Cable master (二分答案)
- POJ1064 Cable master(二分搜索)
- POJ 1064 Cable master (二分搜索)
- HDOJ 1551 Cable master(二分)
- POJ 1064 Cable master(二分)
- PyGobject(十三)布局容器之Button篇——图片按钮和圆形按钮
- Android中 Intent 与 Intent-filter
- Windows 下配置 Nginx PHP
- sort 函数和qsort的区别
- unittest实现HTTP接口功能测试
- HDU1551Cable master(二分)
- TotoiseSVN的基本使用方法
- jsp页面的构成
- 线性时间排序之计数排序,基数排序和桶排序
- Cron定时任务应用到Thinkphp
- java 多线程 回顾
- PIC12系列 TIMER0定时器初始化设置
- 检测view树加载完毕
- 环形链表