Pagini recente » Cod sursa (job #2093737) | Cod sursa (job #2756164) | Cod sursa (job #695622) | Cod sursa (job #1117423) | Cod sursa (job #2218765)
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
const int MOD=666013;
vector <int> H[MOD+5];
int Search(int X)
{
int R=X%MOD;
for(int i=0;i<H[R].size();i++)
if(H[R][i]==X)
return i;
return -1;
}
int Delete(int X)
{
int R=X%MOD,It=Search(X);
if(It!=-1)
H[R].erase(H[R].begin()+It);
}
int Add(int X)
{
int R=X%MOD;
if(Search(X)==-1)
H[R].push_back(X);
}
int main()
{
int N,A,B;
fin>>N;
for(int i=1;i<=N;i++)
{
fin>>A>>B;
if(A==1)
Add(B);
else
if(A==2)
Delete(B);
else
if(A==3)
{
if(Search(B)==-1)
fout<<0<<'\n';
else
fout<<1<<'\n';
}
}
}