-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTwoSets.cpp
64 lines (61 loc) · 1.1 KB
/
TwoSets.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void solve(ll n)
{
ll sum= n*(n+1)/2;
if(sum %2 !=0)
{
cout<<"NO";
return;
}
vector<ll> a,b;
if(n%2==0)
{
for(int i=1;i<=n/2;i++)
{
if(i%2==1)
{
a.push_back(i);
a.push_back(n-i+1);
}
else
{
b.push_back(i);
b.push_back(n-i+1);
}
}
}
else
{
for(int i=1;i<=(n-1)/2;i++)
{
if(i%2==1)
{
a.push_back(i);
a.push_back(n-i);
}
else
{
b.push_back(i);
b.push_back(n-i);
}
}
b.push_back(n);
}
cout<<"YES"<<"\n";
cout<<a.size()<<"\n";
for(ll i:a) cout<<i<<" ";
cout<<"\n";
cout<<b.size()<<"\n";
for(ll i:b) cout<<i<<" ";
}
int main()
{
ios_base::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
ll n;
cin>>n;
solve(n);
}