Pagini recente » Cod sursa (job #2185433) | Cod sursa (job #1153459) | Cod sursa (job #2493489) | Cod sursa (job #1372032) | Cod sursa (job #2932624)
#include <fstream>
#include <unordered_set>
using namespace std;
unordered_set<int> mySet;
int main() {
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n, op, x;
f >> n;
while(n--) {
f >> op >> x;
if (op == 1) {
mySet.insert(x);
}
else {
if (op == 2) {
mySet.erase(x);
}
else {
g << (mySet.find(x) != mySet.end()) << "\n";
}
}
}
f.close();
g.close();
return 0;
}