题解 | 约瑟夫环

#include <stdio.h>

int main() 
{
  int n,k,m,a[100],count=0,step;
  scanf("%d %d %d",&n,&k,&m);
  for(int i=0;i<n;i++)
  {
    a[i]=i;
  }
  int i=k;
  while(count<n-1)
{
    step=0;
    while(step<m)
    {
        if(a[i] != -1)
        {
            step++;
        }
        if(step<m) {
            i=(i+1)%n;
        }
    }

    while(a[i]==-1)
    {
        i=(i+1)%n;
    }
    a[i]=-1;
    count++;

    i = (i + 1) % n;
    while(a[i] == -1 && count < n-1)
    {
        i = (i + 1) % n;
    }
}
    for(int i=0;;i++)
    {
        if(a[i]!=-1)
        {
            printf("%d",a[i]);
            break;
        }
    }
  

}