Cod sursa(job #3173605)
Utilizator | Data | 23 noiembrie 2023 12:26:33 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
unordered_map <int,bool> v;
int main()
{
int n;
cin >> n;
for(int i = 1; i <= n; i++)
{
int x, nr;
cin >> x >> nr;
if(x == 1)
v[nr] = 1;
else if(x == 2)
v[nr] = 0;
else
cout << v[nr] << '\n';
}
return 0;
}