Pagini recente » Cod sursa (job #3342415) | Cod sursa (job #983013) | Cod sursa (job #1785347) | Cod sursa (job #1116670) | Cod sursa (job #2839463)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout("hashuri.out");
const int mod=666013;
vector<int>v[mod+9];
bool cauta(int x){
int m=x%mod;
for(int y:v[m]){
if(y==x){
return 1;
}
}
return 0;
}
void adauga(int x){
if(!cauta(x)){
v[x%mod].push_back(x);
}
}
void sterge(int x){
int m=x%mod,cnt=0;
for(int y:v[m]){
if(y==x){
v[m].erase(v[m].begin()+cnt);
return;
}
cnt++;
}
}
signed main(){
int n;
fin>>n;
for(int i=1;i<=n;i++){
int op,x;
fin>>op>>x;
if(op==1){
adauga(x);
}
if(op==2){
sterge(x);
}
if(op==3){
fout<<cauta(x)<<'\n';
}
}
}