Cod sursa(job #2508125)
Utilizator | Data | 11 decembrie 2019 16:42:14 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map <int,bool> M;
int n,op,a;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>op>>a;
if(op==1)
{
M[a]=1;
}
else if(op==2)
{
M[a]=0;
}
else
{
fout<<M[a]<<"\n";
}
}
return 0;
}