Question

 Write a program to solve the Josephus problem, with the following 
modification:

Sample Input:

./a.out n m p

where n is the number of players and m is the count used for every odd 
turn while p is the count used for every even turn.
Write in c++

Answer 1

ANSWER:

#include<iostream>

#include<cstring>

#include<cstdlib>

using namespace std;

struct node{

int item;

node* next;

node(int x,node* t){

item = x;

next = t;

}

};

int main(int argc,char *argv[]){

int i;

int N = atoi(argv[1]);

int M;

int count = 1;

int m=atoi(argv[2]);

int p = atoi(argv[3]);

node* t;

t = new node(1,0);

t->next = t;

node *x;

x=t;

for(i=2;i<=N;i++){

x = (x->next = new node(i,t));

}

while(x != x->next){

node* a=x;

int k=0;

while(k <N){

cout<<a->item<<" ";

a= a->next;

k++;

}

cout<<endl;

if(count%2 == 1){

M=m;

}

else{

M=p;

}

for(i=1;i<M;i++){

x=x->next;

}

cout<<x->next->item<<"has dropped out"<<endl;

x->next = x->next->next;

count++;

N--;

}

cout<<"Winner is "<<x->item<<endl;

return 0;

}