hdu 1551(二分)
来源:互联网 发布:115会员淘宝不卖了 编辑:程序博客网 时间:2024/05/29 15:16
Cable master
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2919 Accepted Submission(s): 1099
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 <iostream>#include <cstdio>#include <cmath>#include <iomanip>using namespace std;int main(){ int N,K,i,sum1=0; scanf("%d %d",&N,&K); double cable[10005]; int cable2[10005],max=-1; for(i=0;i<N;i++) { scanf("%lf",&cable[i]); cable2[i] = cable[i] * 100; if(cable2[i]>max)max=cable2[i]; } int l = 1, r = max, mid; while(r >= l) { sum1=0; mid = (l + r) / 2; for(i = 0; i < N; i++) { sum1 += floor(cable2[i] / mid); } if(sum1 < K) { r = mid - 1; } else { l = mid + 1; } } mid = (l + r) / 2; printf("%.2f\n",(double)mid / 100); return 0;}
第二种,直接用小数做,只是后面注意精度的处理
#include <iostream>#include <cstdio>#include <cmath>#include <iomanip>using namespace std;int main(){ int N,K,i,sum1=0; scanf("%d %d",&N,&K); double cable[10005],max=-1.0; for(i=0;i<N;i++) { scanf("%lf",&cable[i]); if(cable[i]>max)max=cable[i]; } double l=0,r=max,mid; while(r-l>0.001) { sum1=0; mid=(l+r)/2.0; for(i=0;i<N;i++) { sum1+=floor(cable[i]/mid); } if(sum1<K) { r=mid; } else { l=mid; } } int ans=r*100; //if((double)ans/100-0.01<0)printf("0.00\n");//这句话可以不要,看看题目给的范围就知道了,不会出现这种情况。。所以题目的范围还是很重要的啊 printf("%.2f\n",(double)ans / 100); return 0;}
0 0
- hdu 1551(二分)
- HDU 1551(搜索题,二分)
- 【HDU】1551 - Cable master(二分)
- 【HDU】-1551-Cable master(二分)
- HDU:1551 Cable master(二分)
- 【HDU 1551】Cable master(二分)
- hdu 1551 二分
- hdu 1551(二分)
- hdu 2141(二分)
- hdu 1895(二分)
- hdu 5101(二分)
- 二分二分(POJ 2785 + HDU 2289)
- hdu 1551Cable master(二分)
- HDU 1551 Cable master(二分)
- HDU 1551 Cable master 二分
- hdu 1551 Cable master(二分)
- hdu 1551 Cable master(二分)
- HDU 1551 Cable master 二分
- MFC绘制动态曲线,用双缓冲绘图技术防闪烁
- vector中erase用法注意事项
- C语言的整型和长整型的字节长
- UVA 712(p176)----S-Trees
- 自定义ViewGroup——卫星式菜单的实现
- hdu 1551(二分)
- 大龄恐惧症 (zz)
- 随堂笔记160225表达式
- UML类图几种关系的总结
- 学长的训诫C++
- Servlet_03_ServletConfig
- 操作系统----内存管理
- UVA 714(p244)----Copying Books
- chart控件的简单使用