Pagini recente » Cod sursa (job #391031) | Cod sursa (job #1300646) | Cod sursa (job #523838) | Cod sursa (job #2615255) | Cod sursa (job #3227326)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout("hashuri.out");
const int M=1738692;
vector <int> fv[M];
void INSERT(int val){
int k=val%M;
fv[k].push_back(val);
}
int FIND(int val){
int k=val%M;
for(auto x:fv[k]){
if(x==val) return 1;
} return 0;
}
void ERASE(int val){
int k=val%M;
vector <int> flt;
for(auto x:fv[k]){
if(x!=val){
flt.push_back(x);
}
}
fv[k]=flt;
}
int main() {
int n;
fin>>n;
for(int i=1;i<=n;++i){
int op, x;
fin>>op>>x;
if(op==1){
INSERT (x);
}else if (op==2){
ERASE (x);
}else if (op==3){
fout<< FIND (x)<< "\n";
}
}
return 0;
}