#include "stdio.h"
#include "stdlib.h"
#include "string.h"
typedef struct Linklist
{
int data;
struct Linklist *next;
}linklist;
int create_cycle_link(linklist *&L,int a[],int n)
{
int i;
linklist *s,*r;
for(i=0;i<n;i++)
{
s=(linklist *)malloc(sizeof(linklist));
s->data=a[i];
if(L==NULL)
{
L=s;r=L;
}
else
{
r->next=s;
r=s;
}
}
s->next=L;
return 1;
}
int show_cycle_link(linklist *L)
{
linklist *p;
p=L;
while(p->next!=L)
{
printf("%d ",p->data);
p=p->next;
}
printf("%d ",p->data);
printf("\n");
}
int joseph_ring(linklist *L,int k)
{
int c;
linklist *pre,*p;
p=L;pre=L;
while(p->next!=p)
{
c=1;pre=p;
while(c<k)
{
pre=p;p=p->next;
c++;
}
pre->next=p->next;
free(p);
p=pre->next;
// show_cycle_link(p);
}
printf("the winner is %d\n",p->data);
}
int joseph_ring_array(int a[],int n,int k)
{
int i,j,c;
int *b=(int *)malloc(sizeof(int));
for(i=0;i<n;i++)
b[i]=0;
i=0;c=n;
while(c!=1)
{ j=1;
while(j<k)
{
if(b[i]==0)
j++;
i=(i+1)%n;
}
while(b[i]==1)
i=(i+1)%n;
b[i]=1;
// printf("%d i is %d j is %d \n",a[i],i,j);
c--;
}
for(i=0;i<n;i++)
if(b[i]==0)
printf("the winner is %d \n",a[i]);
}
int joseph_ring_array1(int a[],int n,int k)
{
int i,j,m;
m=0;
while(n!=1)
{
for(j=0;j<k-1;j++)
m=(m+1)%n;
// printf(" %d\n",a[m]);
for(i=m;i<n-1;i++)
a[i]=a[i+1];
n--;
}
printf("the winnner is %d\n",a[0]);
}
main()
{
int a[]={10,9,8,7,6,5,4,3,2,1};
int n=10;
linklist *L=NULL;
create_cycle_link(L,a,n);
show_cycle_link(L);
joseph_ring(L,3);
joseph_ring_array(a,n,3);
joseph_ring_array1(a,n,3);
}