Cod sursa(job #2328508)
Utilizator | Data | 25 ianuarie 2019 20:38:00 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n,x,tip;
map < int,int > m;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>tip>>x;
if(tip==1)
m[x]++;
else
if(tip==2)
m.erase(x);
else
{
if(m.find(x)!=m.end())
fout<<1;
else
fout<<0;
fout<<'\n';
}
}
return 0;
}