Pagini recente » Cod sursa (job #1198526) | Cod sursa (job #1604708) | Cod sursa (job #339579) | Cod sursa (job #2605100) | Cod sursa (job #1198156)
#include<fstream>
#include<algorithm>
#include<map>
using namespace std;
int n,tip,x,nr;
map <int,int> a;
int main()
{
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
cin>>n;
while(n--)
{
cin>>tip>>x;
if(tip==1 && a.find(x)==a.end()) a[x]=++nr;
if(tip==2) a.erase(x);
if(tip==3) if(a.find(x)!=a.end()) cout<<"1"<<'\n'; else cout<<"0"<<'\n';
}
return 0;
}