Josephus Problem in C++

Welcome to the Josephus Problem in C++ page! Here, you'll find the source code for this program as well as a description of how the program works.

Current Solution

#include <iostream>
#include <string>
#include <stdexcept>
using namespace std;

int josephus(int n, int k) {
    if (n == 1)
        return 1;
    else
        return (josephus(n - 1, k) + k - 1) % n + 1;
}

int main(int argc, char* argv[]) {
    const string usage_msg = "Usage: please input the total number of people and number of people to skip.\n";

    if (argc != 3) {
        cerr << usage_msg;
        return 1;
    }

    try {
        int n = stoi(argv[1]);
        int k = stoi(argv[2]);

        if (n <= 0 || k <= 0) {
            cerr << usage_msg;
            return 1;
        }

        int result = josephus(n, k);
        cout << result << endl;
        return 0;

    } catch (...) {
        cerr << usage_msg;
        return 1;
    }
}

Josephus Problem in C++ was written by:

• Apurva Vats

If you see anything you'd like to change or update, please consider contributing.

How to Implement the Solution

No 'How to Implement the Solution' section available. Please consider contributing.

How to Run the Solution

No 'How to Run the Solution' section available. Please consider contributing.