Basic Exercises for Competitive Programming - Python by Jan Pol

Author:Jan Pol
Language: eng
Format: epub, mobi
Tags: algorithms, python, competitive programming

Example

Input

3

Output

YES

1

3

2

2 1

Solution

To solve this task, it first checks if the Gauss sum of the number is even, if it is, it means that it cannot be divided into two sets of sums. Otherwise, two lists and half the Gauss sum are created. For each number in descending order, if the sum is greater than the number, it is subtracted from the sum and stored in one list, otherwise it is stored in the other.

The code for the solution written in Python shown below.

1 n = int(input())

2 if n * (n + 1) / 2 % 2:

3 print("NO")

4 else:

5 print("YES")

6 v1 = []

7 v2 = []

8 sum = n * (n + 1) / 4

9 for i in range(n, 0, -1):

10 if sum >= i:

11 sum -= i

12 v1.append(i)

13 else:

14 v2.append(i)

15

16 print(len(v1))

17 print(*v1)

18 print(len(v2))

19 print(*v2)

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.