Pagini recente » Cod sursa (job #2316364) | Cod sursa (job #2285669) | Cod sursa (job #2972263) | Cod sursa (job #2363738) | Cod sursa (job #2891428)
#include <iostream>
#include <fstream>
#include <vector>
#include <iterator>
using namespace std;
#define size 666073
vector<long long >h[size];
int main() {
ifstream f("hashuri.in");
ofstream g("hashuri.out");
long long n,op,x,j;
long long poz,op3 = 0;
short ok;
f>>n;
for(j = 0;j<n;j++) {
f >> op >> x;
if (op == 1) {
poz = x % size;
ok = 0;
for (auto i = h[poz].begin(); i != h[poz].end(); ++i)
if (*i == x)
ok = 1;
if (ok == 0)
h[poz].push_back(x);
} else if (op == 2) {
poz = x % size;
ok = 0;
for (auto i = h[poz].begin(); i != h[poz].end() && ok == 0; ++i)
if (*i == x) {
h[poz].erase(i);
ok = 1;
}
} else if (op == 3) {
poz = x % size;
ok = 0;
for (auto i = h[poz].begin(); i != h[poz].end() && ok == 0; ++i)
if (*i == x) { ok = 1; }
if (ok == 0)
g << 0 << '\n';
else
g << 1 << '\n';
}
}
f.close();g.close();
return 0;
}