题解 | 约瑟夫环

#include<stdio.h>
int main(){
    int n,k,m;
    scanf("%d %d %d",&n,&k,&m);
    int c=k;
    int a[100]={0};
    int remain=n;
    for(int i=0;i<n;i++){
        a[i]=i;
    }
    while(remain>1){
        int t=(c+m-1)%remain;
        c=t;
        for(int j=t;(j!=n-1)&&a[j+1]!=888;j++){
            a[j]=a[j+1];
            a[j+1]=888;
        }
        remain--;
    }
    printf("%d",a[0]);
    return 0;
}