Pagini recente » Cod sursa (job #2800066) | Cod sursa (job #1168692) | Cod sursa (job #2794650) | Cod sursa (job #2866455) | Cod sursa (job #2736480)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector<int> values(1000000);
int siz;
long long hashfunction(int x) {
return x % 666013;
}
void add(int x) {
long long val = hashfunction(x);
values[siz++] = val;
}
void remo(int x) {
long long val = hashfunction(x);
for (int i = 0; i < siz; i++) {
if (values[i] == val) {
values.erase(values.begin() + i);
}
}
}
void verif(int x) {
long long val = hashfunction(x);
for (int i = 0; i < siz; i++) {
if (values[i] == val) {
fout << '1' << '\n';
return;
}
}
fout << '0' << '\n';
return;
}
int main() {
int op, num;
int n;
fin >> n;
for (int i = 0; i < n; i++) {
fin >> op >> num;
if (op == 1) { add(num); }
else if (op == 2) { remo(num); }
else { verif(num); }
}
return 0;
}