From 146f58d5d91133e43045df719b3f0ae7ad1266f0 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Thu, 13 Feb 2025 15:10:58 -0700 Subject: 1092. two sets --- introductory_problems/readme.md | 7 +++++++ 1 file changed, 7 insertions(+) (limited to 'introductory_problems/readme.md') diff --git a/introductory_problems/readme.md b/introductory_problems/readme.md index 0b39d4d..9607312 100644 --- a/introductory_problems/readme.md +++ b/introductory_problems/readme.md @@ -48,3 +48,10 @@ Your task is to count for `k = 1, 2, ..., n` the number of ways two knights can **Input**: The only input line contains an integer `n`. (Example: 8) **Output**: Print `n` integers: the results. (Example: 0 6 28 96 252 550 1056 1848) + +### Two Sets +Your task is to divide the numbers `1, 2, ..., n` into two sets of equal sum. + +**Input**: The only input line contains an integer `n`. (Example: 7) + +**Output**: Print "YES", if the division is possible, and "NO" otherwise. After this, print if the division is possible, print an example of how to create the sets. -- cgit v1.2.3