Pagini recente » Cod sursa (job #2528328) | Cod sursa (job #569396) | Cod sursa (job #2259166) | Cod sursa (job #1753925) | Cod sursa (job #2417518)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
#define MOD 666013
vector < int > V[MOD];
int N;
inline vector < int > :: iterator Search(int x, int Casuta)
{
vector < int > ::iterator it;
for (it=V[Casuta].begin(); it != V[Casuta].end(); it++)
if (*it == x)
return it;
return V[Casuta].end();
}
void Push(int x)
{
int Casuta=x%MOD;
if (Search(x,Casuta)==V[Casuta].end())
V[Casuta].push_back(x);
}
void Pop(int x)
{
int Casuta=x%MOD;
if (Search(x,Casuta)!=V[Casuta].end())
V[Casuta].erase(Search(x,Casuta));
}
int main()
{
ios_base::sync_with_stdio(0);
fin>>N;
for (int i=1; i<=N; i++)
{
int x,y;
fin>>x>>y;
if (x==1)
Push(y);
if (x==2)
Pop(y);
if (x==3)
{
int k=(Search(y,y%MOD)!=V[y%MOD].end());
fout<<k<<"\n";
}
}
}