Pagini recente » Cod sursa (job #1899371) | Cod sursa (job #1012469) | Cod sursa (job #1633411) | Cod sursa (job #974187) | Cod sursa (job #2725866)
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
map <int,int> M;
int n, m, i, nr, op, x;
int main()
{
fin >> n;
for(i = 1; i <= n; ++i) {
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;
}