Pagini recente » Cod sursa (job #3004935) | Cod sursa (job #125608) | Cod sursa (job #3223788) | Cod sursa (job #3131274) | Cod sursa (job #2773605)
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector <unsigned long long> v[666013];
int main()
{
int n, a, x;
int nrMod = 666013;
fin>>n;
for(int i = 1; i <= n; i++){
fin>>a>>x;
if(a == 1){
bool gasit = false;
for(int i=0;i<v[x % nrMod].size(); ++i){
if(v[x % nrMod][i] == x){
gasit = true;
break;
}
}
if (!gasit) v[x%nrMod].push_back(x);
}
else if(a == 2){
for(int i=0;i<v[x % nrMod].size(); ++i)
if(v[x % nrMod][i] == x)
v[x % nrMod].erase(v[x % nrMod].begin() + i);
}
else {
bool gasit = false;
for(int i=0;i<v[x % nrMod].size(); ++i){
if(v[x % nrMod][i] == x){
gasit = true;
break;
}
}
if (gasit) fout<<"1"<<"\n";
else fout<<"0"<<"\n";
}
}
return 0;
}