-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1092.cpp
103 lines (99 loc) · 3.57 KB
/
1092.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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define endl "\n"
int main()
{
int n, i, sum, j, k, a, b, x;
cin >> n;
sum = (n * (n + 1)) / 2;
if(sum % 2)
{
cout << "NO" << endl;
}
else
{
cout << "YES" << endl;
if(n % 2 == 0)
{
k = n / 2;
int first[k], second[k];
a = b = 0;
for(i = 1, j = n; i <= k && j > k; i++, j--)
{
if(i % 2)
{
first[a] = i;
a++;
first[a] = j;
a++;
}
else
{
second[b] = i;
b++;
second[b] = j;
b++;
}
}
cout << k << endl;
for(i = 0; i < k; i++)
{
cout << first[i] << " ";
}
cout << endl;
cout << k << endl;
for(i = 0; i < k; i++)
{
cout << second[i] << " ";
}
cout << endl;
}
else
{
k = n / 2;
x = k + 1;
int first[k], second[x];
a = b = 0;
first[a] = 3;
a++;
second[b] = 1;
b++;
second[b] = 2;
b++;
if(n > 3)
{
for(i = 4, j = n; i < (4 + (n - 3) / 2) && j >= (4 + (n - 3) / 2); i++, j--)
{
if(i % 2 == 0)
{
first[a] = i;
a++;
first[a] = j;
a++;
}
else
{
second[b] = i;
b++;
second[b] = j;
b++;
}
}
}
cout << k << endl;
for(i = 0; i < k; i++)
{
cout << first[i] << " ";
}
cout << endl;
cout << x << endl;
for(i = 0; i < x; i++)
{
cout << second[i] << " ";
}
cout << endl;
}
}
return 0;
}