能运行的约瑟夫环

  #include <stdio.h>
#include <malloc.h>
#include <memory.h>
//pLeft长度固定为N, 表示队伍中留下人的位置.nLeave是离开的人数, 判断结束
//输出是依次从队伍中离开的人的序号.
int fun(unsigned char *pLeft, int N, int *nLeave, int m, int nStart)
{
 int nCount=0,nPoint=nStart;
 if(pLeft[nPoint]==1)
  nCount++;
 while(nCount<m)
 {
  nPoint=nPoint%N+1;
  if(pLeft[nPoint]==1)
   nCount++;
 }
 (*nLeave)++;
 pLeft[nPoint]=0;
 return nPoint;
}
 
void main(int argc, char *argv[])
{
 int n=0,m=0,nLeave=0,nStart=1;
 printf("输入 人数n,上限m./n");
 scanf("%d,%d",&n,&m);
 unsigned char *pLeft=(unsigned char *)calloc(n+1,sizeof(char));
 memset(pLeft,1,(n+1)*sizeof(char));
 while(nLeave<n)
  printf("%d/t",nStart=fun(pLeft, n, &nLeave, m, nStart));
 free(pLeft);
}