Pagini recente » Cod sursa (job #562591) | Cod sursa (job #1554108) | Cod sursa (job #2340036) | Cod sursa (job #2581113) | Cod sursa (job #2577630)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
const int MOD = 666013;
vector <int> V[MOD];
int N;
vector <int> :: iterator Find(int x)
{
int p=x%MOD;
vector <int> :: iterator it;
for(it=V[p].begin();it!=V[p].end();it++){
if(*it==x){
return it;
}
}
return V[p].end();
}
void inserare(int x)
{
int p=x%MOD;
if(Find(x)==V[p].end()){
V[p].push_back(x);
}
}
void eliminare(int x)
{
int p=x%MOD;
vector <int> :: iterator it;
it=Find(x);
if(it!=V[p].end()){
V[p].erase(it);
}
}
int main()
{
f>>N;
while(N){
int op,x;
f>>op>>x;
if(op==1){
inserare(x);
}else{
if(op==2){
eliminare(x);
}else{
int p=x%MOD;
vector <int> :: iterator it;
it=Find(x);
if(it==V[p].end()){
g<<0<<'\n';
}else{
g<<1<<'\n';
}
}
}
N--;
}
f.close();
g.close();
return 0;
}