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

Magic Numbers II
- 14 Problems
- 70 Finishers
- First N Perfect Squares
- Determine if input is a perfect number
- Project Euler: Problem 9, Pythagorean numbers
- Recurring Cycle Length (Inspired by Project Euler Problem 26)
- Project Euler: Problem 9, Pythagorean numbers
- Recurring Cycle Length (Inspired by Project Euler Problem 26)
- Numbers with prime factors 2, 3 and 5.
- Mersenne Primes
- Determine if input is a Narcissistic number
- Determine if input is a perfect number
- Lychrel Number Test (Inspired by Project Euler Problem 55)
- Largest Twin Primes
- Happy 2013...
- Fermat's Last Theorem - Fermat's conjecture
- P-smooth numbers
- Is it an Armstrong number?
- Champernowne Constant
Problem Recent Solvers189
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!