Pagini recente » Cod sursa (job #1828758) | Cod sursa (job #974878) | Cod sursa (job #448522) | Cod sursa (job #597289) | Cod sursa (job #1549329)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
const int p=666013;
vector<int> H[p+5];
int n, i, t, x;
bool check(int x)
{
int r=x%p;
for(int i=0;i<H[r].size();i++)
if(H[r][i]==x)
return 1;
return 0;
}
void insert(int x)
{
if(check(x))
return;
int r=x%p;
H[r].push_back(x);
}
void erase(int x)
{
//if(!check(x))return;
int r=x%p;
for(int i=0;i<H[r].size();i++)
{
if(H[r][i]==x)
{
swap(H[r][i],H[r].back());
H[r].pop_back();
return;
}
}
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>t>>x;
if(t==1)
{
insert(x);
}
if(t==2)
{
erase(x);
}
if(t==3)
{
fout<<check(x)<<'\n';
}
}
return 0;
}