| Task: | Just do it |
| Sender: | Barren plateau |
| Submission time: | 2024-11-16 12:22:05 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.00 s | details |
| #7 | ACCEPTED | 0.00 s | details |
| #8 | ACCEPTED | 0.00 s | details |
| #9 | ACCEPTED | 0.00 s | details |
| #10 | ACCEPTED | 0.00 s | details |
| #11 | ACCEPTED | 0.00 s | details |
| #12 | ACCEPTED | 0.00 s | details |
| #13 | ACCEPTED | 0.00 s | details |
| #14 | ACCEPTED | 0.00 s | details |
| #15 | ACCEPTED | 0.00 s | details |
| #16 | ACCEPTED | 0.00 s | details |
| #17 | ACCEPTED | 0.00 s | details |
Code
#include <bits/stdc++.h>
using namespace std;
int a[1010];
int main() {
int n;
cin>>n;
for (int i = 0; i<n; i++) a[i] = i+1;
vector<pair<int,int>> toSwap;
for (int k=n-1; k> 0; k-=2) {
toSwap.push_back({k-1,(k+1)/2});
}
for (int k = ((int)toSwap.size())-1;k>=0;k--) {
swap(a[toSwap[k].first],a[toSwap[k].second]);
}
for (int i=0; i< n; i++) {
cout << a[i] << " ";
}
cout<<"\n";
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 2 |
| correct output |
|---|
| 1 2 |
| user output |
|---|
| 2 1 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 3 |
| correct output |
|---|
| 1 2 3 |
| user output |
|---|
| 1 2 3 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 4 |
| correct output |
|---|
| 1 2 3 4 |
| user output |
|---|
| 2 1 3 4 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 5 |
| correct output |
|---|
| 1 2 4 3 5 |
| user output |
|---|
| 1 2 4 3 5 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 6 |
| correct output |
|---|
| 1 2 3 5 4 6 |
| user output |
|---|
| 2 1 3 5 4 6 |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 7 |
| correct output |
|---|
| 1 2 4 6 5 3 7 |
| user output |
|---|
| 1 2 4 6 5 3 7 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 8 |
| correct output |
|---|
| 1 2 3 5 7 6 4 8 |
| user output |
|---|
| 2 1 3 5 7 6 4 8 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 9 |
| correct output |
|---|
| 1 2 4 6 8 3 7 5 9 |
| user output |
|---|
| 1 2 4 6 8 3 7 5 9 |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 10 |
| correct output |
|---|
| 1 2 3 5 7 9 4 8 6 10 |
| user output |
|---|
| 2 1 3 5 7 9 4 8 6 10 |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 99 |
| correct output |
|---|
| 1 2 4 6 8 10 12 14 16 18 20 22... |
| user output |
|---|
| 1 2 4 6 8 10 12 14 16 18 20 22... |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 100 |
| correct output |
|---|
| 1 2 3 5 7 9 11 13 15 17 19 21 ... |
| user output |
|---|
| 2 1 3 5 7 9 11 13 15 17 19 21 ... |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 101 |
| correct output |
|---|
| 1 2 4 6 8 10 12 14 16 18 20 22... |
| user output |
|---|
| 1 2 4 6 8 10 12 14 16 18 20 22... |
Test 13
Verdict: ACCEPTED
| input |
|---|
| 300 |
| correct output |
|---|
| 1 2 3 5 7 9 11 13 15 17 19 21 ... |
| user output |
|---|
| 2 1 3 5 7 9 11 13 15 17 19 21 ... |
Test 14
Verdict: ACCEPTED
| input |
|---|
| 500 |
| correct output |
|---|
| 1 2 3 5 7 9 11 13 15 17 19 21 ... |
| user output |
|---|
| 2 1 3 5 7 9 11 13 15 17 19 21 ... |
Test 15
Verdict: ACCEPTED
| input |
|---|
| 998 |
| correct output |
|---|
| 1 2 3 5 7 9 11 13 15 17 19 21 ... |
| user output |
|---|
| 2 1 3 5 7 9 11 13 15 17 19 21 ... |
Test 16
Verdict: ACCEPTED
| input |
|---|
| 999 |
| correct output |
|---|
| 1 2 4 6 8 10 12 14 16 18 20 22... |
| user output |
|---|
| 1 2 4 6 8 10 12 14 16 18 20 22... |
Test 17
Verdict: ACCEPTED
| input |
|---|
| 1000 |
| correct output |
|---|
| 1 2 3 5 7 9 11 13 15 17 19 21 ... |
| user output |
|---|
| 2 1 3 5 7 9 11 13 15 17 19 21 ... |
