Cod sursa(job #694487)
Utilizator | daniel Daniel30 | Data | 27 februarie 2012 21:17:46 |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<cstdio>
#include<map>
using namespace std;
map<int,int > M;
int n,x,y,nr=0;
int main()
{freopen("hashuri.in","rt",stdin);
freopen("hashuri.out","wt",stdout);
for(scanf("%d",&n);n;--n)
{scanf("%d%d",&x,&y);
switch(x)
{case 1 : if(M.find(y)==M.end()) M[y]=++nr; break;
case 2 : M.erase(y); break;
case 3 : if(M.find(y)!=M.end()) printf("1\n"); else printf("0\n"); break;
}
}
return 0;
}