Cod sursa(job #3276928)
Utilizator | Data | 15 februarie 2025 10:17:18 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
unordered_map <int, int> umap;
int main()
{
fin.tie(0); fin.sync_with_stdio(false);
int n; fin>>n;
for (int i=1; i<=n; i++) {
int op, x; fin>>op>>x;
if (op==1) umap[x]=1;
if (op==2) umap[x]=0;
if (op==3) fout<<umap[x]<<'\n';
}
return 0;
}