Pagini recente » Cod sursa (job #2709121) | Cod sursa (job #629066) | Cod sursa (job #2948876) | Cod sursa (job #853531) | Cod sursa (job #3188768)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
const int MOD = 196613;
vector<vector<int>> m(MOD+3);
int n;
int op, x;
int i;
void adauga(int);
void sterge(int);
bool gaseste(int);
int main()
{
fin >>n;
for (i = 1; i <= n; ++i)
{
fin >>op>>x;
if (op == 1)
{
adauga(x);
continue;
}
if (op == 2)
{
sterge(x);
continue;
}
fout <<gaseste(x)<<'\n';
}
fout.close();
return 0;
}
void adauga(int x)
{
if (gaseste(x)) return;
m[x%MOD].push_back(x);
}
void sterge(int x)
{
for (auto it = m[x%MOD].begin(); it != m[x%MOD].end(); ++it)
if ((*it) == x)
{
m[x%MOD].erase(it);
break;
}
}
bool gaseste(int x)
{
for (auto crt: m[x%MOD])
if (crt == x)
return 1;
return 0;
}