题解 | 约瑟夫环

#include <stdio.h>
int main() {
    int n,k,m,current,population;
    int a[101];
    int num=1;
    scanf("%d %d %d",&n,&k,&m);
    current=k;
    population=n;
    for(int i=0;i<n;i++){
        a[i]=1;
    }
    while(population>=1){
        if(a[current]==1){
        if(num==m){
            a[current]=0;
            population--;
            num=0;
        }
        num++;
        }
        current=(current+1)%n;
    }
    printf("%d",current-1);
    return 0;
}