Cod sursa(job #3030582)
Utilizator | Data | 17 martie 2023 18:53:15 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
unordered_map <int, int> m;
int n, c, x;
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> c >> x;
if (c == 1) m[x] = 1;
else if (c == 2) m[x] = 0;
else cout << m[x] << '\n';
}
return 0;
}