#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
mt19937 rng(123);
#define ld long double
#define ull unsigned long long
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(a) a.begin(), a.end()
#define ff first
#define ss second
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define setp(x) setprecision(x)
ll mod=1e9+7;
int inf=1e9;
const int LOGN = 20;
const int MXX=3e5;
const long double PI = 3.1415926535897932384626433832795;
vector<vi> g;
void solve(){
int n; cin >> n;
cout << "YES\n";
if(n == 2){
cout << "2\n1 1";
}else
if(n == 3){
cout << "2\n2 2";
}else
if(n%2 == 0){
cout << 2*n - 2 << '\n';
for(int i = 2; i <= n; i ++) cout << i << ' ';
for(int i = 2; i <= n; i ++) cout << i << ' ';
}else{
cout << 2*n-2 << '\n';
for(int i = 2; i <= n; i ++){
cout << i << ' ';
}
for(int i = 2; i < n; i ++) cout << i << ' ';
}
}
int main(){
int testcases = 1;
// cin >> testcases;
while(testcases --){
solve(); if(testcases) cout << '\n';
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Integer parameter [name=k] equals to 0, violates the range [1, 5] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Integer parameter [name=k] equals to 0, violates the range [1, 5] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Integer parameter [name=k] equals to 0, violates the range [1, 5] |
| 2 |
Halted |
0 ms |
0 KB |
- |
