Cod sursa(job #3285862)
Utilizator | Data | 13 martie 2025 15:21:27 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <random>
#include <fstream>
#include <stack>
#include <bitset>
#include <unordered_map>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map<int,bool> M;
int main()
{
int n;
fin >> n;
for (int i = 1; i <= n; i++)
{
int q;
fin >> q;
int x;
fin >> x;
if (q == 1)
M[x] = 1;
else if (q == 2)
M[x] = 0;
else
fout << M[x] << '\n';
}
return 0;
}