Cod sursa(job #2633371)
Utilizator | Data | 7 iulie 2020 13:25:45 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
int T, p, x;
unordered_map <int,int> m;
int main()
{
in >> T;
while(T--)
{
in >> p >> x;
if(p == 1)
{
m[x] = 1;
}
else if(p == 2)
{
m[x] = 0;
}
else
out << (m[x] ? 1 : 0) << '\n';
}
return 0;
}