Pagini recente » Cod sursa (job #750870) | Cod sursa (job #723002) | Cod sursa (job #1561758) | Cod sursa (job #1546394) | Cod sursa (job #1396242)
#include <fstream>
#define md 666013
#include <vector>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector <int> a[666013];
int i,n,x,y;
bool find(int x)
{
int i,r;
r=x%md;
for(i=0;i<a[r].size();i++)
if(a[r][i]==x)return true;
return false;
}
void insereaza(int x)
{
int r;
r=x%md;
if(find(x)==false)
a[r].push_back(x);
}
void sterge(int x)
{
int i,r;
r=x%md;
for(i=0;i<a[r].size();i++)
if(a[r][i]==x)
{
swap(a[r][i],a[r][a[r].size()-1]);
a[r].pop_back();
}
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x>>y;
if(x==1)insereaza(y);
else
if(x==2)sterge(y);
else if(find(y)==true)fout<<1<<'\n';
else fout<<0<<'\n';
}
return 0;
}