/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 2ms 532.0 KiB

Code

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

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int n;
        cin >> n;
        vector<int> a(n);
        for(int i = 0; i < n; i++)
        {
            a[i] = i + 1;
        }
            

        for(int i = 0; i + 1 < n; i += 2)
        {
            swap(a[i], a[i + 1]);
        }
            
        if (n % 2 == 1)
            swap(a[n - 1], a[n - 2]);

        for(int i = 0; i < n; i++) 
        {
            cout << a[i];
            if (i != n - 1)
                cout << " ";
        }
        cout << "\n";
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1210 A. Smallest Permutation
Contest
Educational Round 1
Language
C++17 (G++ 13.2.0)
Submit At
2025-07-14 16:40:51
Judged At
2025-07-14 16:40:51
Judged By
Score
100
Total Time
2ms
Peak Memory
532.0 KiB