Josephus problem

3

2 votes
Problem

Given the total number of persons n and a number k which indicates that k-1 persons are skipped and a kth person is killed in a circle in a fixed direction. After each operation, the count will start from k+1th person. The task is to choose the safe place in the circle so that when you perform these operations starting from 1st place in the circle, you are the last one remaining and survive.

Example 1:

Input:

n = 3, k = 2

Output: 3

Explanation:

There are 3 persons so skipping 1 person i.e 1st person 2nd person will be killed. Thus the safe position is 3.

Time Limit: 5
Memory Limit: 256
Source Limit:
Explanation

There are 3 persons so skipping 1 person i.e 1st person 2nd person will be killed. Thus the safe position is 3.

Editor Image

?