02_sorting_and_searching/distinct_numbers_1621.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13

#include <iostream>
#include <set>

int main() {
	int n, x;
	std::set<int> s;
	std::cin >> n;
	for (int i = 0; i < n; i++) {
		std::cin >> x;
		s.insert(x);
	}
	std::cout << s.size() << "\n";
}