Cod sursa(job #2449922)
Utilizator | Doru Floare doruf | Data | 21 august 2019 10:37:02 |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map <int, bool> Array;
int op, x, n;
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
{
fin >> op >> x;
if (op == 1) Array[x] = true;
if (op == 2) Array[x] = false;
if (op == 3) fout << Array[x] << '\n';
}
fin.close();
fout.close();
return 0;
}