Pagini recente » Cod sursa (job #897475) | Cod sursa (job #138286) | Cod sursa (job #399515) | Cod sursa (job #407644) | Cod sursa (job #1439552)
#include <iostream>
#include <fstream>
#include <vector>
#define P 104729
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector <int> H[P];
int main()
{
int n, i, v, x, r, j, L;
fin >> n;
for (i = 1; i <= n; i++)
{
fin >> x >> v;
r = v % P;
L = H[r].size();
if (x == 1)
{
for (j = 0; j < L && H[r][j] != v; j++);
if (j == L)
H[r].push_back(v);
}
else if (x == 2)
{
for (j = 0; j < L && H[r][j] != v; j++);
if (j < L)
H[r].erase(H[r].begin() + j);
}
else if (x == 3)
{
for (j = 0; j < L && H[r][j] != v; j++);
if (j == L) fout << "0\n";
else fout << "1\n";
}
}
fout.close();
return 0;
}