Cod sursa(job #1699163)
Utilizator | Nasture Anca Nasture | Data | 6 mai 2016 13:42:12 |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.26 kb |
#include<cstdio>
#include<vector>
using namespace std;
#define MOD 666013
vector <int> H[666014];
int main(){
int n,i,op, nr,r,pp;
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
for(int ii=1;ii<=n;ii++){
scanf("%d%d",&op,&nr);
if(op==1){
pp=0;
r=nr%MOD;
for(i=0;i<H[r].size()&&pp==0;i++)
if(H[r][i]==nr)
pp=1;
if(pp==0)
H[nr%MOD].push_back(nr);
}
else
if(op==2){
r=nr%MOD;
vector<int>::iterator it;
for (it=H[r].begin();it!= H[r].end();++it)
if (*it==nr){
if(it!=H[r].end())
H[r].erase(it);
break;
}
}
else
if(op==3){
pp=0;
r=nr%MOD;
for(i=0;i<H[r].size()&&pp==0;i++)
if(H[r][i]==nr)
pp=1;
if(pp==0)
printf("0\n");
else
printf("1\n");
}
}
return 0;
}