LightOj 1179 Josephus Problem

Tutorial : Josephus Problem

#include <bits/stdc++.h>
using namespace std;

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

int main()
{
    int i,j,k,a,b,t;
    cin>>t;
    for(i=1;i<=t;i++)
    {
        cin>>a>>b;
        printf("Case %d: %d\n",i,lastman(a,b));
    }
    return 0;
}

Download Coding Interview Book and Get More Tutorials for Coding and Interview Solution: Click Here

Download System Design Interview Book and Get More Tutorials and Interview Solution: Click Here

Do you need more Guidance or Help? Then Book 1:1 Quick Call with Me: Click Here

Share on Google Plus

About Ashadullah Shawon

I am Ashadullah Shawon. I am a Software Engineer. I studied Computer Science and Engineering (CSE) at RUET. I Like To Share Knowledge. Learn More: Click Here