Card Trick

#include<bits/stdc++.h>

using namespace std;

int n;
queue<int> q;
int order[20];

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++)
        q.push(i);
    int k = 1;
    while (!q.empty()){
        for (int i = 0; i < k; i++) {
            q.push(q.front());
            q.pop();
        }
        order[q.front()] = k++;
        q.pop();
    }
    cout << order[1];
    for (int i = 2; i <= n; i++) {
        cout << " " << order[i];
    }
    cout << endl;
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED