Submission #1381828

---

Source Code Expand

#define _USE_MATH_DEFINES // for C++  
#include <cmath> 
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <utility>
#include <set>
#include <random>
#include <map>
#include <stack>
#include <queue>
#include <list>
#include <functional>
#include <bitset>
#define LL long long
#define NUM 1000000007

using namespace std;

int main() {
    int n, count = 0;
    cin >> n;
    map<int, int> m;
    for (size_t i = 0; i < n; i++)
    {
        int tmp;
        cin >> tmp;
        auto itr = m.find(tmp);
        if (itr == m.end())
        {
            m.insert(make_pair(tmp, 0));
        }
        else
        {
            itr->second++;
        }
    }
    for (auto itr = m.begin(); itr != m.end() ; itr++)
    {
        if (itr->second > 0)
        {
            count += itr->second;
        }
    }
    cout << count << endl;
}

Submission Info

Judge Result