Cod sursa(job #2107533)
Utilizator | Data | 17 ianuarie 2018 15:00:49 | |
---|---|---|---|
Problema | Hashuri | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
unordered_map <int, int> a;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
int n, i, op, x;
int main() {
fin >> n;
for (i = 1; i <= n; ++i) {
fin >> op >> x;
if (op == 1) ++a[x];
else if (op == 2) --a[x];
else if (a[x]) fout << 1 << '\n';
else fout << 0 << '\n';
}
}