Pagini recente » Cod sursa (job #1668631) | Cod sursa (job #186856) | Cod sursa (job #2393746) | Cod sursa (job #1528294) | Cod sursa (job #2906721)
#include <fstream>
#include <vector>
#define hnum 666013
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector<int> v[1000001];
int n, aleg, num, i, j, poz;
bool ok;
int main() {
fin >> n;
for (i = 0; i < n; ++i) {
fin >> aleg >> num;
poz = num % hnum;
switch (aleg) {
case 1: {
v[poz].push_back(num);
break;
}
case 2: {
for (j = 0; j < v[poz].size(); ++j) {
if (v[poz][j] == num) {
v[poz].erase(v[poz].begin() + j);
}
}
break;
}
case 3: {
ok = false;
for (j = 0; j < v[poz].size() && !ok; ++j) {
if (v[poz][j] == num) {
fout << "1\n";
ok = true;
}
}
if (!ok) {
fout << "0\n";
}
break;
}
}
}
return 0;
}