Code
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc; cin >> tc;
while(tc--){
int n; cin >> n;
if(n % 2 == 0){
for(int i = 1; i <= n; i += 2){
cout << i + 1 << ' ' << i << ' ';
}
cout << '\n';
}
else{
for(int i = 1; i < n - 2; i += 2){
cout << i + 1 << ' ' << i << ' ';
}
int x = n - 2;
int y = n;
int z = n - 1;
cout << z << ' ' << y << ' ' << x << '\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 15:35:44
- Judged At
- 2025-07-14 15:35:44
- Judged By
- Score
- 100
- Total Time
- 2ms
- Peak Memory
- 532.0 KiB