summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--sorting_searching/distinct_numbers.cpp14
-rw-r--r--sorting_searching/readme.md8
2 files changed, 22 insertions, 0 deletions
diff --git a/sorting_searching/distinct_numbers.cpp b/sorting_searching/distinct_numbers.cpp
new file mode 100644
index 0000000..00cd4c5
--- /dev/null
+++ b/sorting_searching/distinct_numbers.cpp
@@ -0,0 +1,14 @@
+// 1621. Distinct Numbers
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+ static int n, x;
+ set<int> s;
+ scanf("%d", &n);
+ for (int i = 0; i < n; i++) {
+ scanf("%d", &x);
+ s.insert(x);
+ }
+ printf("%d\n", (int)s.size());
+}
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)