Cod sursa(job #239241)
Utilizator | Data | 4 ianuarie 2009 14:00:41 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<stdio.h>
#include<map>
using namespace std;
int n,NR;
map <int, int> sol;
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
int x,y;
for(int i=1;i<=n;i++)
{
scanf("%d %d",&x,&y);
if(x==1&&sol.find(x)==sol.end())
sol[y] = ++NR;
if(x==2)
sol.erase(y);
if(x==3)
printf("%d\n", sol.find(y) != sol.end());
}
return 0;
}