Cod sursa(job #3258505)
| Utilizator | Data | 22 noiembrie 2024 21:58:26 | |
|---|---|---|---|
| Problema | Frac | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | cex_3 | Marime | 0.75 kb |
#include <iostream>
#include <queue>
using namespace std;
deque<int> dq;
int main()
{
int t; cin >> t;
for(; t >= 1; t --)
{
int n; cin >> n;
if(n <= 4)
cout << -1 << '\n';
else{
dq.push_back(1);
dq.push_back(3);
dq.push_back(5);
dq.push_back(4);
dq.push_back(2);
for(int i = 6; i <= n; i ++)
if(i % 2 == 0)
dq.push_back(i);
else
dq.push_front(i);
while(!dq.empty()){
cout << dq.front() << " ";
dq.pop_front();
}
cout << '\n';
}
}
return 0;
}
