Cod sursa(job #1551672)
Utilizator | Data | 16 decembrie 2015 11:40:38 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
#include<unordered_set>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
int N,i,type,element,nr;
int main()
{
cin>>N;
unordered_set <int>M;
for(i=1;i<=N;i++)
{
cin>>type>>element;
if(type==1)
M.insert(element);
else if(type==2)
M.erase(element);
else
cout<<(M.find(element)!=M.end())<<"\n";
}
return 0;
}