Pagini recente » Borderou de evaluare (job #770840) | Borderou de evaluare (job #2198255) | Borderou de evaluare (job #1968268) | Cod sursa (job #1574307) | Cod sursa (job #2743578)
#include <bits/stdc++.h>
using namespace std;
int main()
{
ifstream f("hashuri.in");
ofstream g("hashuri.out");
unordered_map<int, bool> m;
int n;
f>>n;
for(short i=1; i<=n; ++i)
{
int com, x;
f>>com>>x;
if(com==1)
m[x]=1;
else
if(com == 2)
m.erase(x);
else
if(m.find(x) == m.end())
g<<0<<"\n";
else
g<<1<<"\n";
}
return 0;
}