Josephus Problem.cpp

/*  Bismillah hir rahmanir raheem. Thanks to Allah for everything.
    Coder: Abdullah Al Imran
    Email: [email protected]   */

#include<bits/stdc++.h>

using namespace std;

int josephus(int n, int k)
{
     if (n==1)
         return 1;
     else
    /* The position returned by josephus(n - 1, k) is adjusted because the
       recursive call josephus(n - 1, k) considers the original position
       k%n + 1 as position 1 */
     return (josephus(n-1,k)+k-1)%n+1;
}

int main()
{
    ios_base::sync_with_stdio(false);

    return 0;
}