Cod sursa(job #472536)
Utilizator | Data | 25 iulie 2010 15:37:31 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <set>
using namespace std;
set<int> S[32768];
int main ()
{int n,x,op;
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
for (int i=1;i<=n;i++)
{scanf("%d %d",&op,&x);
switch(op)
{case 1:S[x&32767].insert(x>>15);break;
case 2:S[x&32767].erase(x>>15);break;
case 3:printf("%d\n",S[x&32767].count(x>>15));break;
}
}
return 0;
}