Pagini recente » Cod sursa (job #1619848) | Cod sursa (job #2086990) | Cod sursa (job #2938313) | Cod sursa (job #1737982) | Cod sursa (job #1687416)
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map<int,bool> h;
int n,t,x,i;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>t>>x;
if(t==1&&!h.count(x)) h[x]=1;
else if(t==2&&h.count(x)) h.erase(x);
else if(t==3)fout<<h.count(x)<<"\n";
}
return 0;
}