Pagini recente » Cod sursa (job #944127) | Cod sursa (job #1991299) | Cod sursa (job #818609) | Cod sursa (job #1092835) | Cod sursa (job #2282278)
#include <fstream>
#include <vector>
#include <algorithm>
#define MOD 1000007
using namespace std;
ifstream in{"hashuri.in"};
ofstream out{"hashuri.out"};
vector<int> h[MOD];
int main()
{
int k;
in >> k;
while (k--) {
int cod, n;
in >> cod >> n;
auto it = find(h[n % MOD].begin(), h[n % MOD].end(), n);
if (cod == 1) {
if (it == h[n % MOD].end())
h[n % MOD].push_back(n);
}
if (cod == 2) {
if (it != h[n % MOD].end())
h[n % MOD].erase(it);
}
if (cod == 3)
out << (it != h[n % MOD].end()) << '\n';
}
}