题解 | 约瑟夫环

#include <stdio.h>

int main()
{
    int n = 0, k = 0, m = 0;
    scanf("%d %d %d",&n,&k,&m);
    int arr[100] = {0};
    int i = 0,j = 0;
    for(i = 0; i < n; i++)
    {
        arr[i] = i;
    }
    int aim = 0;
    for(j = n-1; j > 0; j--)
    {    
        aim = (k+m-1)%n;
        for(i = 0; i<n-1-aim; i++)
            arr[aim+i] = arr[aim+i+1];
        k = aim;
        n--;
    }
    printf("%d",arr[0]);
    return 0;
}