Pagini recente » Cod sursa (job #3132727) | Cod sursa (job #3196901) | Cod sursa (job #2621586) | Cod sursa (job #3143961) | Cod sursa (job #2253293)
#include<bits/stdc++.h>
using namespace std;
#define MOD 89989
vector<int> ls[MOD];
vector<int>::iterator find_el(int x){
int list = x % MOD;
for(vector<int>::iterator it = ls[list].begin() ; it != ls[list].end() ; it++){
if(*it == x)
return it;
}
return ls[list].end();
}
void stergere(int x){
int list = x % MOD ;
if(find_el(x) != ls[list].end())
ls[list].erase(find_el(x));
}
void adaugare(int x){
int list = x % MOD ;
if(find_el(x) == ls[list].end())
ls[list].push_back(x);
}
int main(){
ifstream in("hashuri.in");
ofstream out("hashuri.out");
int x , tip , n ;
in >> n ;
while(n--){
in >> tip >> x ;
if(tip == 1){
adaugare(x);
continue;
}
if(tip == 2){
stergere(x) ;
continue;
}
if(tip == 3) {
int ans = find_el(x) != ls[x % MOD].end();
out << ans << '\n';
}
}
}