题解 | 怪异的洗牌

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, k;
    while (cin >> n >> k) {
        if (n == 0)break;
        int a[n];
        for (int i = 1; i <= n; i++)a[i - 1] = i;
        while (k--) {
            int x;
            cin >> x;
            int cnt = n - x;
            int b[n];
            for (int i = 0; i < n; i++) {
                b[(i + cnt) % n] = a[i];
            }
            reverse(b, b + n / 2);
            for (int i = 0; i < n; i++) {
                a[i] = b[i];
            }
        }
        for(int i=0;i<n;i++)cout<<a[i]<<" ";
        cout<<endl;
    }
}

模拟