hdu1551
来源:互联网 发布:linux系统ping 编辑:程序博客网 时间:2024/06/04 22:46
Cable master
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2561 Accepted Submission(s): 960
Problem 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 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.
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).
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 118.027.434.575.390 0
Sample Output
2.00
本题大意是让求每段最长切割的电缆长度,首先,用二分法解题,以待求的的段数和二分得到的段数为判断条件。以每段最长切割长度为未知量。
#include<cstdio>int n,m;double a[10010];bool f(double x){ int sum=0,j; for(j=0;j<n;j++) sum+=(int)(a[j]/x); return sum>=m;}int main(){ int i; while(scanf("%d%d",&n,&m),(m||n)) { for(i=0;i<n;i++) scanf("%lf",&a[i]); double left=0,right=100000,mid; int t=200; while(t--) { mid=(left+right)/2; if(f(mid)) left=mid; else right=mid; }right=(int)(right*100)/100.0; printf("%.2f\n",right); } return 0; }
0 0
- hdu1551
- hdu1551
- HDU1551
- HDU1551(二分)
- hdu1551 二分
- hdu1551 Cable master
- HDU1551:Cable master(二分)
- hdu1551 简单二分
- Cable master--hdu1551(二分法)
- HDU1551:Cable master(二分)
- HDU1551 Cable master(二分)
- HDU1551:Cable master(二分)
- HDU1551:Cable master(二分)
- HDU1551:Cable master(二分)
- HDU1551&&HDU1064 Cable master
- Cable master(hdu1551,二分查找)
- hdu1551-二分&细节-Cable master
- hdu1551题解(wa了好多次)
- Mybatis学习(1)-------------快速入门
- [HDU 3278] Puzzle BFS+位压缩
- 淘宝diamond
- Android WebView Long Press长按保存图片到手机
- Android 屏幕适配方案
- hdu1551
- HDOJ--2199 Can you solve this equation?(附题意)
- UDP协议
- PAT (Advanced Level) 1090. Highest Price in Supply Chain (25) 供应链,BFS
- github for windows_English version.
- java调用DLL
- 哪些管理类的书籍值得推荐?
- Html5 与CSS3中的新特性
- 非常非常小的DLL源代码