题解 | 约瑟夫环

#include <stdio.h>

int main() {
        int n = 0;
        int k = 0;
        int m = 0;
        scanf("%d %d %d", &n, &k, &m);
        int i = 0;
        int people[100] = { 0 };
        int num_count = 0;//报数计数
        int num_pos = k;//从编号为k的人开始报数
        int people_count = n;//队中剩余人数
        while (people_count > 1) {
            if (people[num_pos] == 0) { //0为在队
                num_count++;//报数从1到m
                if (num_count == m) { //报到m时出队
                    people[num_pos] = 1;//1为出队
                    people_count--;
                    num_count = 0;//重新报数
                }
            }
            num_pos = (num_pos + 1) % n;//循环移动到下一个人
        }
        for (i = 0; i < n ; i++) {
            if (people[i] == 0) { //只剩一个人在队
                printf("%d", i);
                break;
            }
        }
        return 0;
    }