HDU1551:Cable master(二分)
来源:互联网 发布:mac怎么设置默认输入法 编辑:程序博客网 时间:2024/05/17 02:18
<span style="font-size:14px;"><span style="font-size:18px;"> <span style="font-size:32px;">Cable master</span></span></span><span style="font-size:14px;">DescriptionInhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committeehas 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.</span><table border="1" cellpadding="1" cellspacing="1" width="20"><tbody><tr><td> </td><td> </td></tr><tr><td> </td><td> </td></tr><tr><td> </td><td> </td></tr></tbody></table>The Cable Master of the company was assigned to the task. He knows the length of each cable in the stockup to a centimeter, and he can cut them with a centimeter precision being told the length of the pieceshe 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. InputThe input consists of several testcases. The first line of each testcase contains two integer numbersN 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. OutputFor 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 Input4 118.027.434.575.390 0 Sample Output2.00 解决代码:<pre name="code" class="cpp">#include<stdio.h> #include<string.h> #include<math.h> #include<algorithm> using namespace std; #define exp 1e-8 int n,k; double a[10005],sum; int judge(double s) { int cnt = 0; for(int i = 0; i<n; i++) { cnt+=(int)(a[i]/s); } if(cnt>=k) return 1; return 0; } int main() { int i; while(~scanf("%d%d",&n,&k),n+k) { sum = 0; for(i = 0; i<n; i++) { scanf("%lf",&a[i]); sum+=a[i]; } sum = sum/k; double l = 0,r = sum; while(abs(l-r)>exp) { double mid = (l+r)/2; if(judge(mid)) l = mid; else r = mid; } printf("%.2f\n",l); } return 0; }
0 0
- HDU1551:Cable master(二分)
- HDU1551:Cable master(二分)
- HDU1551 Cable master(二分)
- HDU1551:Cable master(二分)
- HDU1551:Cable master(二分)
- HDU1551:Cable master(二分)
- Cable master(hdu1551,二分查找)
- hdu1551-二分&细节-Cable master
- hdu1551 Cable master
- Cable master--hdu1551(二分法)
- HDU1551&&HDU1064 Cable master
- 二分——HDU1551:Cable master (精度控制)
- Cable master 二分
- POJ1064 Cable master(二分)
- POJ1064 Cable master 二分
- POJ1064 Cable master 二分
- POJ1064 Cable master(二分)
- POJ1064 Cable master(二分)
- Navicat for MySQL错误
- Word中LNCS格式模板使用教程
- 对多线程开发的理解,以及几种实现方法
- HTML&CSS基础学习笔记1.18-表格的边框
- 记录我的第一篇博客
- HDU1551:Cable master(二分)
- 偷之趣事一
- Mockplus实例之一看就会de五个交互功能
- VC++链接错误LNK2001总结
- 为Python3.5安装Pygame
- js的对象及this
- 非常可乐-特殊的BFS题
- 找工作之计算机网络复习
- android多个视频叠加,音频混合,视频字幕