Pagini recente » Cod sursa (job #697223) | Cod sursa (job #3252824) | Cod sursa (job #901535) | Cod sursa (job #1204601) | Cod sursa (job #2233661)
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <vector>
using namespace std;
#define mod 666013
int n;
vector<int> g[mod];
vector<int>::iterator fnd(int x)
{
int i=x%mod;
vector<int>::iterator it;
for(it=g[i].begin();it!=g[i].end();++it)
{
if (*it==x) return it;
}
return g[i].end();
}
void ers(int x)
{
int i=x%mod;
vector<int>::iterator it=fnd(x);
if(it!=g[i].end()) g[i].erase(it);
}
void insrt(int x)
{
int i=x%mod;
vector<int>::iterator it=fnd(x);
if(it==g[i].end()) g[i].push_back(x);
}
ifstream f("hashuri.in");
ofstream h("hashuri.out");
int x,p,j;
int main()
{
f>>n;
for(j=1;j<=n;j++)
{
f>>p>>x;
if(p==1) insrt(x);
if(p==2) ers(x);
if(p==3)
{
if(fnd(x)==g[x%mod].end()) h<<0<<endl;
else h<<1<<endl;
}
}
return 0;
}