Cod sursa(job #2745979)
Utilizator | Data | 27 aprilie 2021 12:32:59 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <unordered_set>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
long x, op, N ,i;
unordered_set <long long> multime;
int main()
{
f >> N;
for (i = 0; i < N; i++)
{
f >> op >> x;
if (op == 1)
{
multime.insert(x);
}
else if (op == 2)
{
multime.erase(x);
}
else
{
if (multime.find(x) != multime.end())
{
g << 1 << endl;
}
else
g << 0 << endl;
}
}
}