Pagini recente » Cod sursa (job #845571) | Cod sursa (job #3210410) | Istoria paginii runda/oji_2005_10 | Cod sursa (job #874050) | Cod sursa (job #1101563)
#include <iostream>
#include <fstream>
#include <unordered_set>
using namespace std;
using namespace __GXX_EXPERIMENTAL_CXX0X__;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_set<int> Mult;
int op, x, M;
int main() {
fin >> M;
while (M--) {
fin >> op >> x;
if (op == 1) {
Mult.insert(x);
}else
if (op == 2) {
Mult.erase(x);
}else
if (op == 3) {
if (Mult.find(x) != Mult.end())
fout << 1 << '\n';
else fout << 0 << '\n';
}
}
fin.close();
fout.close();
return 0;
}