I seem to get 1773 for test case 6.
I also get 1773 for test case 6
I'll look into it a bit later on. In the meantime, that test case is deleted, so you can see if your solutions work for the rest of the test cases.
An interesting test case would have kill_every=1.
Am I the only one who finds the problem description really lacking? WTF does it mean "Because Prisoner 10 was counted during the first iteration,..." IMHO this is just blah and not a well-defined problem definition...
I passed test 3 by using a WHILE loop but not a recursive function. IMHO the method should not affect the test cases but in this case it does.
This is a hard one it took me a while to solve it. Thanks God Roman empire has fallen log time ago otherwise I would have no chance to escape decimation.
test 3 fails. not because of an infinite recursion in my program but owing to the lack of memory. My program is correct
really wonderful thought!!! One of the best solution!
how does this work?
To paraphrase Arthur C Clarke: "Any sufficiently advanced Cody solution from Alfonso is indistinguishable from magic."
Generalized Josephus problem
great solution! (effectively working backwards to get the initial state)
Remove the two elements next to NaN value
Sum of odd numbers in a matrix
Tick. Tock. Tick. Tock. Tick. Tock. Tick. Tock. Tick. Tock.
Break it up! Break it up!
With apologies to William Blake
The Hills Are Alive...
A (wrong) place for everything, and everything in its (wrong) place
Sums of Distinct Powers
Find the treasures in MATLAB Central and discover how the community can help you!
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office