APCS 2022/01

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

int func(int n, int m) {
    int arr[100];
    int tail = 0, i;
    for (i = 1; i <= n; i++) {
        arr[tail] = i;
        tail = tail + 1;
    }
    int head = -1, count = 0;
    while (tail > head + 1) {
        count = count + 1;
        head = head + 1;
        if (count == m) {
            arr[tail] = arr[head];
            count = 0;
            tail = tail + 1;
        }
    }
    return arr[head];
}