Cod sursa(job #1235821)
Utilizator | Panaete Adrian proflaurian | Data | 30 septembrie 2014 18:59:06 |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdio>
#include <set>
#define P 100003
using namespace std;
int n,c,v,h;
set<int> T[P];
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
for(;n;n--)
{
scanf("%d%d",&c,&v);
h=v%P;
if(c==1)
T[h].insert(v);
else
if(c==2)
T[h].erase(v);
else
T[h].find(v)==T[h].end()? printf("0\n"):printf("1\n");
}
return 0;
}