Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Aggressive Cows Problem Statement Solution #802

Closed
1 task done
dewanshiPaul opened this issue Mar 26, 2022 · 2 comments
Closed
1 task done

Aggressive Cows Problem Statement Solution #802

dewanshiPaul opened this issue Mar 26, 2022 · 2 comments
Assignees

Comments

@dewanshiPaul
Copy link
Contributor

Description

A question solving using binary search with proper documentation of it. The question as follows:-
There is a new barn with N stalls and C cows. The stalls are located on a straight line at positions x1,….,xN (0 <= xi <= 1,000,000,000). We want to assign the cows to the stalls, such that the minimum distance between any two of them is as large as possible. What is the largest minimum distance?

Domain

Other

Type of Contribution

Addition

Code of Conduct

@github-actions
Copy link

Hello @dewanshiPaul, thanks for creating your first issue at LearnCPP, hope you followed the guidelines.

@github-actions
Copy link

This issue has been assigned to dewanshiPaul!
It will become unassigned if it is not closed within 12 days. A maintainer can also add the pinned label to prevent it from being unassigned.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant