Pagini recente » Cod sursa (job #550940) | Cod sursa (job #2253410) | Cod sursa (job #1841605) | Cod sursa (job #1394929) | Cod sursa (job #1967482)
#include<bits/stdc++.h>
using namespace std;
#define MOD 666013
int N;
vector<int> G[MOD];
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
inline vector <int >::iterator verifica(int x){
vector<int>::iterator it;
int li = x%MOD;
for(it=G[li].begin(); it!=G[li].end(); it++){
if(*it==x) return it;
}
return G[li].end();
}
inline void insereaza(int x){
if(verifica(x)==G[x%MOD].end()) G[x%MOD].push_back(x);
}
inline void sterge(int x){
vector<int>::iterator it =verifica(x);
if(it !=G[x%MOD].end()) G[x%MOD].erase(it);
}
int main(){
int op, x;
fin>>N;
while(N--){
fin>>op>>x;
if(op==1) insereaza(x);
else if(op==2) sterge(x);
else if(op==3){ if(verifica(x)==G[x%MOD].end()) fout<<0<<'\n';
else fout<<1<<'\n';
}
}
return 0;
}