Cod sursa(job #2419094)
Utilizator | Data | 7 mai 2019 17:37:16 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map<int,int>H;
int n,op,x;
int main()
{int i;
fin>>n;
for(i=1;i<=n;i++)
{fin>>op>>x;
if(op==1)
H[x]++;
else
if(op==2 && H[x])
H[x]=0;
else
if(op==3)
{if(H[x])
fout<<1<<'\n';
else
fout<<0<<'\n';
}
}
return 0;
}