Pagini recente » Cod sursa (job #1247125) | Cod sursa (job #2539573) | Cod sursa (job #3178654) | Cod sursa (job #2185602) | Cod sursa (job #2439532)
#include <bits/stdc++.h>
#define cin fi
#define cout fo
using namespace std;
ifstream fi("hashuri.in");
ofstream fo("hashuri.out");
const int MOD = 10000019;
int n;
list <int> h[MOD - 1];
inline int f(int x)
{
return x - x / MOD * MOD;
}
void baga(int x)
{
int val = f(x);
bool este = 0;
for (auto it = h[val].begin(); it != h[val].end(); it++)
if ((*it) == x)
este = 1;
if (!este)
h[val].push_back(x);
}
void scoate(int x)
{
int val = f(x);
for (auto it = h[val].begin(); it != h[val].end(); it++)
if ((*it) == x)
it = h[val].erase(it);
}
bool verif(int x)
{
int val = f(x);
for (auto it = h[val].begin(); it != h[val].end(); it++)
if ((*it) == x)
return 1;
return 0;
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
{
int op, x;
cin >> op >> x;
if (op == 1)
{
baga(x);
}
else if (op == 2)
{
scoate(x);
}
else
{
cout << verif(x) << "\n";
}
}
return 0;
}