Pagini recente » Cod sursa (job #2000731) | Istoria paginii runda/concurs_000000 | Cod sursa (job #1356843) | Cod sursa (job #2751641) | Cod sursa (job #282979)
Cod sursa(job #282979)
#include<fstream>
#include<vector>
#define Mod 666013
using namespace std;
vector<int>m[Mod];
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n,op,x,k,i,aux;
vector<int>::iterator src(int a)
{ aux=a%Mod;
vector<int>::iterator it;
for(it=m[aux].begin();it!=m[aux].end();it++)
if(*it==a)
return it;
return m[aux].end();
}
int insert(int a)
{ aux=a%Mod;
vector<int>::iterator it;
it=src(a);
if(it==m[aux].end())
m[aux].push_back(a);
return 0;
}
int del(int a)
{ aux=a%Mod;
vector<int>::iterator it;
it=src(a);
if(it!=m[aux].end())
m[aux].erase(it);
return 0;
}
int main()
{ fin>>n;
for(i=1;i<=n;i++)
{ fin>>op>>x;
if(op==1) insert(x);
if(op==2) del(x);
if(op==3)
if(src(x)!=m[x%Mod].end()) fout<<1<<'\n';
else fout<<0<<'\n';
}
return 0;
}