Submission #3283022

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>


using namespace std;
using ll = long long;
using ull = unsigned long long;

const ll INF = 1e16;
const ll MOD = 1e9 + 7;

#define REP(i, n) for(ll i = 0; i < n; i++)




int main() {
    ll n;
    cin >> n;
    vector<ll> d(n);
    REP(i, n){
        cin >> d[i];
    }
    sort(d.begin(), d.end());
    ll ans = 1;
    REP(i, n - 1){
        if(d[i] < d[i + 1]){
            ans++;
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result