Cod sursa(job #1101563)
| Utilizator | Data | 8 februarie 2014 18:13:59 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#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;
}
