Pagini recente » Cod sursa (job #166789) | Cod sursa (job #1435124) | Cod sursa (job #1091664) | Cod sursa (job #1246295) | Cod sursa (job #1512948)
#include <cstdio>
#include <vector>
using namespace std;
const int mod = 666013;
vector <int> g[mod];
int n,c,nr;
vector<int>::iterator find_val(int x){
for(vector<int>::iterator it = g[x%mod].begin(); it != g[x%mod].end(); ++it)
if(*it == x)
return it;
return g[x%mod].end();
}
void insert_val(int x){
if(find_val(x) == g[x%mod].end())
g[x%mod].push_back(x);
}
void erase_val(int x){
vector<int>::iterator it = find_val(x);
if(it != g[x%mod].end())
g[x%mod].erase(it);
}
int main(){
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
scanf("%d", &n);
for(int i = 1; i <= n; ++i){
scanf("%d %d", &c, &nr);
if(c == 1)
insert_val(nr);
else if(c == 2)
erase_val(nr);
else
printf("%d\n", find_val(nr) != g[nr%mod].end());
}
return 0;
}