Code
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll tc;
cin>>tc;
while(tc--)
{
ll n;
cin>>n;
if(n==1)
cout<<1<<endl;
else if(n==2)
cout<<2<<' '<<1<<endl;
else if(n==3)
cout<<2<<" "<<3<<" "<<1<<endl;
else
{
vector<ll>o,e;
for(int i=2;i<=n;i+=2)
e.push_back(i);
for(int i=1;i<=n;i+=2)
o.push_back(i);
if(n%2==0)
{
for(int i=0;i<n/2;i++)
cout<<e[i]<<" "<<o[i]<<" ";
cout<<endl;
}
else
{
for(int i=0;i<e.size()-1;i++)
cout<<e[i]<<' '<<o[i]<<" ";
cout<<e[e.size()-1]<<" "<<o[o.size()-1]<<" "<<o[o.size()-2]<<endl;
}
}
}
}
Information
- Submit By
- Type
- Submission
- Problem
- P1210 A. Smallest Permutation
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2025-07-15 20:29:47
- Judged At
- 2025-07-15 20:29:47
- Judged By
- Score
- 100
- Total Time
- 2ms
- Peak Memory
- 532.0 KiB