competitive-coding/A_Divisible_Permutation.cpp at main · ashwera/competitive-coding · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define yes cout << "YES"  << endl;
#define no cout << "NO" << endl;
#define input for(int &i:v) cin >> i;

void print(const vector<int>& v) {
    for (int i : v) {
        cout << i << " ";
    }
    cout << endl;
}

void solve() {
    int n; cin >> n;
    vector<bool>v(n);
    for(int i=0;i<n;i++){
        v[i] = false;
    }
    vector<int>ans(n);
    if(n%2==0){
        ans[n-1] = n;
    v[ans[n-1]] = true;
    for(int i=n-2;i>0;i--){
        if((i+1)%2!=0)
        ans[i] = abs(ans[i+1] - i - 1);
        else
        ans[i] = ans[i+1]+i+1;

        ans[i] = ans[i]%n;
        v[ans[i]-1] = true;
    }
    for(int i=0;i<n;i++){
        if(v[i]==false){
            ans[0]=i+1;
            break;
        }
    }
    }
    else{
        ans[n-1] = n;
    v[ans[n-1]] = true;
    for(int i=n-2;i>0;i--){
        if((i+1)%2==0)
        ans[i] = abs(ans[i+1] - i - 1);
        else
        ans[i] = ans[i+1]+i+1;

        ans[i] = ans[i]%n;
        v[ans[i]-1] = true;
    }
    for(int i=0;i<n;i++){
        if(v[i]==false){
            ans[0]=i+1;
            break;
        }
    }
    }
    print(ans);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
    int t;
    cin >> t;
    while (t-- > 0) {
        solve();
    }
}