This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(),(x).end()
#define X first
#define Y second
#define sep ' '
#define endl '\n'
#define debug(x) cerr << #x << ": " << x << endl;
const ll MAXN = 1e6 + 10;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n;
cin >> n;
cout << "YES" << endl;
if (n == 1) return cout << 1 << endl << 1 << endl, 0;
if (n == 2) return cout << 2 << endl << 1 << sep << 1 << endl, 0;
cout << 2 * (n - 2) << endl;
if (n & 1) {
for (int i = n - 1; i > 1; i--) cout << i << sep;
for (int i = n - 1; i > 1; i--) cout << i << sep;
cout << endl;
} else {
for (int i = 2; i < n; i++) cout << i << sep;
for (int i = n - 1; i > 1; i--) cout << i << sep;
cout << endl;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |