Pagini recente » Cod sursa (job #1767088) | Cod sursa (job #2908554) | Cod sursa (job #767880) | Cod sursa (job #575088) | Cod sursa (job #828839)
Cod sursa(job #828839)
#include <cstdio>
#include <vector>
#define p 666013
using namespace std;
vector<int> f[p];
int find(int x){
for(vector<int>::iterator it=f[x%p].begin();it!=f[x%p].end();++it){
if(x==*it) return 1;
}
return 0;
}
void scoate(int x){
for(vector<int>::iterator it=f[x%p].begin();it!=f[x%p].end();++it){
if(x==*it) {
f[x%p].erase(it);
break;
}
}
}
int main () {
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
int n,i,op,x;
scanf("%d",&n);
for(i=1;i<=n;++i){
scanf("%d %d",&op,&x);
if (op==1){
if(find(x)==0) f[x%p].push_back(x);
}
else if (op==2){scoate(x);}
else printf("%d\n",find(x));
}
return 0;
}