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>
#define all(x) (x).begin(), (x).end()
#define int long long
using namespace std;
const int MAXN = 1e3 + 11;
int32_t main(){
int n, m; cin >> n >> m;
if(n == 1){
cout << "YES\n1\n1\n";
return 0;
}
cout << "YES" << endl;
cout << (n - 1) * 2 + 1 << endl;
if(n % 2){
for(int i = 1; i <= n; i++){
cout << i << ' ';
}
for(int i = 1; i <= n - 1; i++){
cout << i << ' ';
}
}else{
for(int i = 1; i <= n - 1; i++){
cout << i << ' ';
}
for(int i = 1; i <= n; i++){
cout << i << ' ';
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |