Pagini recente » Cod sursa (job #119247) | Cod sursa (job #2231009) | Istoria paginii runda/simulareoji_2010_11-12_miercuri/clasament | Cod sursa (job #951821) | Cod sursa (job #2550425)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map <int,int> a;
int n;
int main()
{
fin >> n;
for(;n;n--)
{
int x,y;
fin >> x >> y;
if(x==1)
a[y]=y;
if(x==2 and a.find(y)!=a.end())
a.erase(a.find(y));
if(x==3)
fout << (a.find(y)!=a.end()) << "\n";
}
return 0;
}