Problem 1668. Josephus Survivor

Created by Richard Zapor

Solve Later

The Josephus Challenge is to find the position that is the last remaining when every Kth item is removed from a list of N items. The removal wraps from the end to the start.

Input: N, K where N is the number of players and K is the removal period.

Output: S the last position remaining

Example: N=4 K=2 produces the sequence

1 2 3 4; 1 3 4; 1 3; 1

Comment:

This is a replication of Decimation by James but has a different Historical story reference.

Solve

Solution Stats

Last solution submitted on Apr 28, 2019

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

J.R.! Menzinger on 21 Jun 2013

Hi Richard, this problem is the same as this other one: http://www.mathworks.de/matlabcentral/cody/problems/1092-decimation
isn't it??
So I think there is an error on test case number 4 and 5... :-(

andrea84 on 21 Jun 2013

Really like this problem, btw i also got issues with those test cases

James on 21 Jun 2013

I made the Decimation problem referenced above, and I had problems with my test suite as well. Looks like we both would have been standing in the wrong spot in the circle... :-(

Richard Zapor on 21 Jun 2013

I thought I had the right solutions but was unsure. I searched for Josephus to see if this was a duplication, I will look at decimation.