Cody

Problem 1668. Josephus Survivor

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.

Solution Stats

27.97% Correct | 72.03% Incorrect
Last Solution submitted on Mar 17, 2020

Problem Comments

Problem Recent Solvers24

Suggested Problems

More from this Author236

Problem Tags