Cable master
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 31226 | Accepted: 6621 |
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 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).
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
题目大意:
有n条绳子,每条长度为a[i],如果从他们中切割出相同数量的绳子的话,找出能切出的最长的能有多长,答案保留两位小数。
分析:
假定一个可行解,并判断它是否可行。用二分 + 贪心的思想求解。
一定要注意对小数位的控制,我一直错在这里了。
#include<iostream>
#include<algorithm>
#include<string.h>
#include<stdio.h>
#include<math.h>
#define M(i,m,n) for(int i = m;i < n;i ++)
using namespace std;
const int MAX = 100010;
int n,k;
double a[10010];
bool C(double x) ///统计所能分的最大的长度相同的段数
{
int sum = 0;
M(i,0,n)
sum += (int)(a[i] / x);
return sum >= k;
}
void solve()
{
double x = 0,y = MAX;
while(y - x >= 1e-6) ///
{
double mid = (x + y) / 2.0;
if(C(mid))
x = mid;
else ///返回为true的情况,包含sum = k;故下面输出的时候是关于y的
y = mid;
}
printf("%.2f\n",floor(y * 100) / 100);
}
int main()
{
while(~scanf("%d%d",&n,&k))
{
M(i,0,n)
scanf("%lf",&a[i]);
solve();
}
return 0;
}
#include<algorithm>
#include<string.h>
#include<stdio.h>
#include<math.h>
#define M(i,m,n) for(int i = m;i < n;i ++)
using namespace std;
const int MAX = 100010;
int n,k;
double a[10010];
bool C(double x) ///统计所能分的最大的长度相同的段数
{
int sum = 0;
M(i,0,n)
sum += (int)(a[i] / x);
return sum >= k;
}
void solve()
{
double x = 0,y = MAX;
while(y - x >= 1e-6) ///
{
double mid = (x + y) / 2.0;
if(C(mid))
x = mid;
else ///返回为true的情况,包含sum = k;故下面输出的时候是关于y的
y = mid;
}
printf("%.2f\n",floor(y * 100) / 100);
}
int main()
{
while(~scanf("%d%d",&n,&k))
{
M(i,0,n)
scanf("%lf",&a[i]);
solve();
}
return 0;
}
关于代码中的floor函数,看下面代码的实现
///floor向下取整
#include<stdio.h>
#include<math.h>
int main()
{
double number=123.54;
double down;
down=floor(number);
up=floor(number);
printf("original_number%10.2lf\n",number);
printf("number_rounded_down%10.2lf\n",down);
return 0;
}
#include<stdio.h>
#include<math.h>
int main()
{
double number=123.54;
double down;
down=floor(number);
up=floor(number);
printf("original_number%10.2lf\n",number);
printf("number_rounded_down%10.2lf\n",down);
return 0;
}