Cod sursa(job #3160654)
Utilizator | Data | 24 octombrie 2023 19:28:36 | |
---|---|---|---|
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");
int main() {
int n;
cin >> n;
unordered_map<int, bool> m;
for (int i = 0; i < n; ++i) {
int p, x;
cin >> p >> x;
if (p == 1) m[x] = true;
else if (p == 2) m[x] = false;
else {
cout << m[x] << '\n';
}
}
return 0;
}