Cod sursa(job #2725862)
| Utilizator | Data | 19 martie 2021 19:20:18 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
map <int,int> M;
int main()
{
int n; fin >> n;
int nr = 0;
for(int i = 1; i <= n; ++i) {
int op, x; fin >> op >> x;
if(op == 1 && M.find(x) == M.end())
M[x] = ++nr;
if(op == 2)
M.erase(x);
if(op == 3) {
if(M.find(x) != M.end()) fout << "1\n";
else fout << "0\n";
}
}
return 0;
}
