Pagini recente » Cod sursa (job #1808467) | Monitorul de evaluare | Cod sursa (job #2857912) | Cod sursa (job #899949) | Cod sursa (job #632143)
Cod sursa(job #632143)
#include <cstdio>
#include <vector>
#define Mod 666013
using namespace std;
vector <int> H[Mod];
vector <int>:: iterator it;
int n, x, op, ind, i;
vector <int>::iterator find_v(int x){
for(it=H[ind].begin(); it!=H[ind].end(); it++)
if (*it==x) return it;
return it;
}
void insert_v(int x){
if(it==H[ind].end()) H[ind].push_back(x);
}
void erase_v(int x){
if(it!=H[ind].end()) H[ind].erase(it);
}
void write_v(int x){
if(it!=H[ind].end()) printf("1\n");
else printf("0\n");
}
int main(){
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d\n", &n);
for(i=1; i<=n; i++){
scanf("%d%d\n", &op, &x);
ind= x % Mod;
it= find_v(x);
if(op==1) insert_v(x);
if(op==2) erase_v(x);
if(op==3) write_v(x);
}
return 0;
}