约舍夫问题

/*

约舍夫问题：
M个人围成圈，相邻相继编号1-M；
从1号人开始1号报数；
如果所报数为m，则撤出圆圈队伍。相邻的下一位报数者从1开始。
直至剩下最后一位，求其是第几位。

*/

# include<stdio.h>

void main(){
    int M = 0; int sum = 0; int m = 0;  int tmp = 0; int Num = 0;
    printf("Input the number(<1000) of people:
");
    wscanf_s(L"%d", &M);
    printf("Input the number that people would say:
");
    wscanf_s(L"%d", &m);
    int k [1000];
    for(int j = 0; j <1000; j++){
        k[j] = 1;
    }                                         //init k[]
    while(Num!=M-1)
    {
      printf("The %d loop
",m);

      for (int i = 0; i < M; i++){        
        if (k[i] == 1)
        {
            sum++;
            if (sum % m == 0)
            {
                k[i] = 0; printf("Remove %d
", i+1); Num++;           //The people that ID is i+1 remove.  add 1. 
                
            }
         }
        if (Num == M-1)                                               //The rest of people is one. Out of the loop.
            break;
      }    
    }
    
    for (int j = 0; j < M; j++){
        if (k[j]==1)
        printf("The last people ID is %d", j+1);

    }
    system("pause");
}