22 lines
441 B
C++
22 lines
441 B
C++
#include <bits/stdc++.h>
|
|
using namespace std;
|
|
const int N = 3010;
|
|
int a[N];
|
|
set<int> s;
|
|
int main() {
|
|
int n;
|
|
cin >> n;
|
|
a[1] = 1;
|
|
for (int k = 2; k <= n; k++) {
|
|
if (a[k - 1] - k > 0 && s.count(a[k - 1] - k) == 0) {
|
|
a[k] = a[k - 1] - k;
|
|
s.insert(a[k - 1] - k);
|
|
} else
|
|
a[k] = a[k - 1] + k;
|
|
}
|
|
sort(a + 1, a + n + 1);
|
|
for (int i = 1; i <= n; i++)
|
|
cout << a[i] << " ";
|
|
return 0;
|
|
}
|