Cod sursa(job #2951149)
Utilizator | Data | 5 decembrie 2022 16:07:27 | |
---|---|---|---|
Problema | Hashuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
unordered_map<int ,int> m;
int main()
{
int nr, o, x;
cin >> nr;
for(int j = 1; j <= nr; ++ j)
{
cin >> o >> x;
if(o == 1)
m[x] = 1;
else if(o == 2)
m[x] = 0;
else
cout << m[x] << '\n';
}
return 0;
}