Code
#include<bits/stdc++.h>
using namespace std;
int main(){
int x, T;
cin >> T;
for(int i = 0; i < T; i++){
cin >> x;
vector<int>arr(x);
if(x % 2 == 0){
for(int i = 0 ; i < x; i++){
arr[i] = i + 2;
arr[i+1] = i + 1;
i = i+1;
}
}
else{
for(int i = 0; i < x; i++){
arr[i] = i + 2;
arr[i + 1] = i + 1;
i += 1;
}
arr[x-1] = x;
swap(arr[x-1], arr[x-2]);
}
for(auto a: arr){
cout << a << " ";
}
cout << endl;
arr.clear();
}
}
Information
- Submit By
- Type
- Submission
- Problem
- P1210 A. Smallest Permutation
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2025-07-14 20:28:17
- Judged At
- 2025-07-14 20:28:17
- Judged By
- Score
- 100
- Total Time
- 2ms
- Peak Memory
- 532.0 KiB