Submission #3442255

---

Source Code Expand

#include<iostream>
#include <string>
#include<algorithm>
#include <set>
using namespace std;

int main(void){
	ios::sync_with_stdio(false);
	int N,i,j,k;
	cin >> N;
	int d[N];
	for (i = 0; i < N; i++) cin >> d[i];
	sort(d, d + N, greater<int>());
	j = 1;
	k = 0;
	for (i = 0; i < N-1; i++) {
		if (d[i] != d[i + 1]) j++;
	}

	cout << j << endl;
	return 0;
}

Submission Info

Judge Result