Cod sursa(job #1982544)
Utilizator | Data | 19 mai 2017 12:23:25 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
map <int,int>a;
int n,Nr;
int main()
{
int tip,x;
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>tip>>x;
if(tip==1 && a.find(x)==a.end()) a[x]=++Nr;
if(tip==2) a.erase(x);
if(tip==3) fout<<(a.find(x)!=a.end())<<"\n";
}
return 0;
}