Problem 1940. Decimation - Optimized for speed
This problem is similar to http://www.mathworks.com/matlabcentral/cody/problems/1092-decimation, only this time the score will be based on how quickly you can determine which person will survive.
The sample sizes (num_prisoners) and number of prisoners killed (num_killed) will be larger than in the original problem, but other than that the problem sets are identical.
Solution Stats
Problem Comments
-
2 Comments
Not quite identical to the original problem. In the original problem kill_every is always larger or equal 2, here it can be also 1...
My submissions keep getting an error that they time out for all the test cases. Running tic/toc on it for case one in the Scratch Pad it takes 0.003869sec. My solution works for problem 1092. If I hard code a numeric output the test cases do not time out.
Solution Comments
Show commentsGroup

Basics - Binary Logic
- 10 Problems
- 958 Finishers
- Find the longest sequence of 1's in a binary sequence.
- Convert given decimal number to binary number.
- Find out sum and carry of Binary adder
- Binary numbers
- Given an unsigned integer x, find the largest y by rearranging the bits in x
- Bit Reversal
- Relative ratio of "1" in binary number
- Binary code (array)
- Converting binary to decimals
- There are 10 types of people in the world
Problem Recent Solvers183
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!