poj 1064 java_poj1064

r囧r小猫 2022-11-05 03:30 203阅读 0赞

Cable master

Time Limit: 1000MS

Memory Limit: 10000K

Total Submissions: 15127

Accepted: 3200

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 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).

Sample Input

4 11

8.02

7.43

4.57

5.39

Sample Output

2.00

Source

发表评论取消回复

表情：

评论列表（有 0 条评论，203人围观）

还没有评论，来说两句吧...

相关阅读

相关 poj1064（二分）Cable master

//二分判断 /假定一个解并判断是否可行题意：有n条绳子，长度分别为L[i]。如果从他们中切割出k条长度相同的绳子的话，这k条绳子每条最长能有多长

女爷i/ 2024年02月18日 14:02/ 0 赞/ 18 阅读

相关二分搜索刷题——电缆切割POJ1064

题目描述（POJ1064）：有N条电缆，长度分别为Li，如果从它们中切割出K条长度相同的电缆，每条电缆最长有多少米。输入：输入的第一行包含两个整数N和K（1

小鱼儿/ 2022年11月15日 14:18/ 0 赞/ 176 阅读

相关 poj 1064 java_poj1064

Cable master Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 15127 Accept

r囧r小猫/ 2022年11月05日 03:30/ 0 赞/ 204 阅读

相关 MySQL -1064

目录标题楔子出错sql 解决楔子 > 学习时出现 1064错误。出错sql SELECT ename,

素颜马尾好姑娘i/ 2022年10月12日 12:13/ 0 赞/ 185 阅读

相关 Cable master POJ - 1064 题解

题目链接 https://vjudge.net/problem/POJ-1064 当然我是在Virtual Judge上面写的，可以直接去POJ去提交。这个题目感觉

冷不防/ 2022年09月02日 04:16/ 0 赞/ 172 阅读

相关 lightoj 1064 动态规划

1064 - Throwing Dice <table> <tbody> <tr> <td title="normal judge"><a href="ht

爱被打了一巴掌/ 2022年07月28日 01:09/ 0 赞/ 106 阅读

相关 MySQL 1064 错误

ERROR 1064 : You have an error in your SQL syntax; check the manual that corresponds to

我不是女神ヾ/ 2022年04月06日 06:44/ 0 赞/ 276 阅读

相关 leetcode1064

思路1:使用顺序查找 1 class Solution: 2 def fixedPoint(self, A: 'List[int]') -> int:

不念不忘少年蓝@/ 2021年12月19日 04:15/ 0 赞/ 142 阅读

相关 POJ 1064 Cable master（二分答案）

嗯... 题目链接：[http://poj.org/problem?id=1064][http_poj.org_problem_id_1064] 其实

骑猪看日落/ 2021年10月23日 17:56/ 0 赞/ 236 阅读

相关 Cable master POJ - 1064 (二分精度)

[题目][Link 1] 思路：二分每条绳子的长度，循环100次即可。判断条件：每一段向下取整求最大可以裁剪的数量，如果所有数量大于等于k则满足l=mid,小于则

柔光的暖阳◎/ 2021年07月16日 15:34/ 0 赞/ 302 阅读