Pagini recente » Cod sursa (job #1451890) | Cod sursa (job #1379131) | Cod sursa (job #958215) | Cod sursa (job #463705) | Cod sursa (job #650595)
Cod sursa(job #650595)
#include<fstream>
#include<vector>
using namespace std;
#define hash 666013
vector<int> H[hash];
vector<int>::iterator cautare(int x){
int lista=x%hash;
vector<int>::iterator i;
for(i = H[lista].begin();i!=H[lista].end();i++)
if(*i==x) return i;
return H[lista].end();
}
void insereaza(int x){
int lista=x%hash;
if(cautare(x)==H[lista].end())
H[lista].push_back(x);
}
void stergere(int x){
int lista=x%hash;
vector<int>::iterator i=cautare(x);
if(i!=H[lista].end())
H[lista].erase(i);
}
int main(){
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
int x,op,n;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d %d", &op, &x);
if(op==1) {insereaza(x);continue;}
if(op==2) {stergere(x);continue;}
printf("d\n",(cautare(x) != H[x%hash].end()));
}
return 0;
}