kottans / kottans/algorithm_club
skiena 2-51 top challenge
- Dominant language
- JavaScript
- Stars
- 14
- Forks
- 14
- PR merge metrics
- No merged PRs in 30d
Description
Six pirates must divide $300 dollars among themselves. The division is to proceed
as follows. The senior pirate proposes a way to divide the money. Then the pirates
vote. If the senior pirate gets at least half the votes he wins, and that division
remains. If he doesn’t, he is killed and then the next senior-most pirate gets a
chance to do the division. Now you have to tell what will happen and why (i.e.
, how many pirates survive and how the division is done)? All the pirates are
intelligent and the first priority is to stay alive and the next priority is to get as
much money as possible.
Contributor guide
No contributing guide indexed for this repository
Research direction
The issue contains the pirate-division puzzle but names no file, test, or entry point. First clarify where the solution should be recorded and the expected format, then work through the voting sequence and document the survivor count and division; done when an agreed explanation is added.
Written by the indexing model from the issue text.
Assessment
- Domain
- content
- Issue type
- Documentation
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100