Pagini recente » Diferente pentru problema/fft intre reviziile 26 si 8 | Cod sursa (job #169154) | Cod sursa (job #2916641) | Cod sursa (job #2785153) | Cod sursa (job #2468675)
#include <bits/stdc++.h>
using namespace std;
map <int,int> m;
int main()
{
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
int n,x,y;
cin>>n;
for(int i=1;i<=n;i++){
cin>>x>>y;
switch(x){
case 1:
m[y]=1;
break;
case 2:
m[y]=0;
break;
case 3:
if(m[y]==1)
cout<<1<<"\n";
else
cout<<0<<"\n";
break;
}
}
return 0;
}