Pagini recente » Cod sursa (job #3235398) | Cod sursa (job #2677675) | Cod sursa (job #378687) | Cod sursa (job #815134) | Cod sursa (job #2097088)
#include <fstream>
#include <vector>
#define PRIM 30103
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int N, i, j, X, op, rest;
vector <int> H[PRIM];
vector <int> :: iterator it;
bool gasit;
int main()
{
fin >> N;
for (i=1; i<=N; i++)
{
fin >> op >> X;
rest=X % PRIM;
gasit=false;
for (it=H[rest].begin(); it!=H[rest].end(); it++)
{
if (*it==X)
{
gasit=true;
break;
}
}
if (op==3)
{
if (gasit==true)
fout << 1;
else
fout << 0;
fout << '\n';
}
if (op==1)
if (gasit==false)
H[rest].push_back(X);
if (op==2)
if (gasit==true)
H[rest].erase(it);
}
fin.close();
fout.close();
return 0;
}