Josephus Survivor - MATLAB Cody - MATLAB Central

Problem 1668. Josephus Survivor

Difficulty:
(28)
Rate

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

33.56% Correct | 66.44% Incorrect
Last Solution submitted on Sep 25, 2024

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers36

Suggested Problems

More from this Author308

Problem Tags

mod puzzle

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Go to top of page