summaryrefslogtreecommitdiff
path: root/introductory_problems/readme.md
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-02-13 15:10:58 -0700
committerJack Sangdahl <[email protected]>2025-02-13 15:10:58 -0700
commit146f58d5d91133e43045df719b3f0ae7ad1266f0 (patch)
treeb82764947719cd159cecfa056c9a6a1a80f6b6fa /introductory_problems/readme.md
parent3331ee948ededea78a774eb53facec06035af4c8 (diff)
downloadcses-146f58d5d91133e43045df719b3f0ae7ad1266f0.tar.gz
cses-146f58d5d91133e43045df719b3f0ae7ad1266f0.zip
1092. two sets
Diffstat (limited to 'introductory_problems/readme.md')
-rw-r--r--introductory_problems/readme.md7
1 files changed, 7 insertions, 0 deletions
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.