Submission #1948558

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>

using namespace std;

int main(void){
    int N, tempInt;
    vector<int> Mochi;
    cin  >> N;
    for(int i = 0; i < N; i++){
        cin >> tempInt;
        Mochi.push_back(tempInt);
    }
    sort(Mochi.begin(), Mochi.end());
    
    tempInt = -1;
    
    int count = 0;
    for(int i = 0; i < Mochi.size(); i++){
        if(tempInt != Mochi[i]){
            tempInt = Mochi[i];
            count++;
        }
    }
    cout << count << endl;
}

Submission Info

Judge Result