Josephus Problem

Medium Algorithmic Challenges

Solve in Playground →

Problem Statement

Write a C program to solve the Josephus problem: given N people standing in a circle and counting every K-th person for elimination, find the survivor.

Input Format

Two space-separated integers N and K.

Output Format

Print the surviving person position (1-indexed).

Constraints

1 <= N, K <= 1000

Sample Input

5 2

Sample Output

Explanation

Standard Josephus problem survivor for 5 people eliminating every 2nd person is 3.

Starter Code

#include <stdio.h>

int josephus(int n, int k) {
    // Write your code here
}

int main() {
    int n, k;
    if (scanf("%d %d", &n, &k) == 2) {
        printf("%dn", josephus(n, k));
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →