Cod sursa(job #3195946)
| Utilizator | Data | 22 ianuarie 2024 11:58:23 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map <int, bool> m;
int main()
{
int n,c,x;
fin >> n;
while(n--){
fin >> c >> x;
if(c == 1) m[x] = 1;
else if(c == 2) m[x] = 0;
else fout << m[x] << "\n";
}
return 0;
}
