Cod sursa(job #1816194)
| Utilizator | Data | 26 noiembrie 2016 11:06:23 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <cstdio>
#include <set>
#define B 500000
using namespace std;
int op,N,val;
set <int> H[B+1];
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
cin>>N;
for(int i=1;i<=N;i++)
{
cin>>op>>val;
if(op==1)
{
H[val%B].insert(val);
}
else if(op==2)
{
H[val%B].erase(val);
}
else
{
if(H[val%B].find(val)!=H[val%B].end())
cout<<1;
else
cout<<0;
cout<<'\n';
}
}
return 0;
}
