Pagini recente » Cod sursa (job #2111006) | Cod sursa (job #1297164) | Cod sursa (job #22211) | Cod sursa (job #2389590) | Cod sursa (job #1887208)
#include <bits/stdc++.h>
#define MOD 666013
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int N;
vector<int> H[MOD];
vector<int>::iterator Find(int x)
{
for(vector<int>::iterator it=H[x%MOD].begin();it!=H[x%MOD].end();it++)
if(*it==x)
return it;
return H[x%MOD].end();
}
void Insert(int x)
{
if(Find(x)==H[x%MOD].end())
H[x%MOD].push_back(x);
}
void Erase(int x)
{
vector<int>::iterator it=Find(x);
if(it!=H[x%MOD].end())
H[x%MOD].erase(it);
}
int main()
{
fin>>N;
while(N--)
{
int op,x;
fin>>op>>x;
if(op==1)
Insert(x);
if(op==2)
Erase(x);
if(op==3)
Find(x)!=H[x%MOD].end() ? fout<<"1\n" : fout<<"0\n";
}
return 0;
}