Submission #1946582

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <array>
#include <cassert>
#include <bitset>
using namespace std;
using LL = long long;

int main(void)
{
	int N;
	set<int>S;
	cin >> N;
	for (int i = 0; i < N; ++i) {
		int s;
		cin >> s;
		S.insert(s);
	}
	cout << S.size() << endl;
	return 0;
}

Submission Info

Judge Result