summaryrefslogtreecommitdiff
path: root/sorting_searching/readme.md
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-05 13:25:03 -0700
committerJack Sangdahl <[email protected]>2025-03-05 13:25:03 -0700
commit355b45504388c883ac8477a8748d8053208a5ffd (patch)
tree3e05ab4557978f2946f61cc86270d88d50388b1f /sorting_searching/readme.md
parent4ff18ecb768e4636e0c63af33ae7acb2cad7edc6 (diff)
downloadcses-master.tar.gz
cses-master.zip
1621. distinct numbersHEADmaster
Diffstat (limited to 'sorting_searching/readme.md')
-rw-r--r--sorting_searching/readme.md8
1 files changed, 8 insertions, 0 deletions
diff --git a/sorting_searching/readme.md b/sorting_searching/readme.md
new file mode 100644
index 0000000..6e1061c
--- /dev/null
+++ b/sorting_searching/readme.md
@@ -0,0 +1,8 @@
+## Searching and Sorting
+
+### Distinct Numbers
+You are given a list of `n` integers, and your task is to calculate the number of distinct values in the list.
+
+**Input**: The first input line has an integer `n`: the number of values. The second line has `n` integers `x1, x2, ..., xn`. (Example: 5 2 3 2 2 3)
+
+**Output**: Print one integer: the number of distinct values. (Example: 2)