Cod sursa(job #3287104)
Utilizator | Data | 15 martie 2025 17:06:29 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
int n,x,op;
unordered_map<int,int>f;
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{
in>>op>>x;
if(op==1)
f[x]=1;
else if(op==2)
f[x]=0;
else
out<<f[x]<<'\n';
}
return 0;
}