DMOJ · set

Unique Elements

This C++ solution uses simulation for DMOJ set Unique Elements. Read the reasoning, inspect the code, or try your own test case below.

setData structuresSimulationC++28 lines
Solution232of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Unique Elements matches the list input and required distinct-element count.

Data structures

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

unique_elements.cpp

C++

    #include <bits/stdc++.h>
     
    using namespace std;
     
    #define f first
    #define s second
    #define pb push_back
    #define eb emplace_back
    #define mp make_pair
     
    typedef long long ll;
    const int INF = 0x3f3f3f3f;
    //#define int long long 
     
    int main() {
        ios::sync_with_stdio(0);
        cin.tie(0); 
        int n;
        cin >> n;
        unordered_set<int>s;
        for(int i = 0; i < n; i++){
            int x; cin >> x;
            s.insert(x);
        }
        cout << s.size() << '\n';
        return 0;
    }
     
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.