Pagini recente » Cod sursa (job #92896) | Cod sursa (job #3280240) | Cod sursa (job #714004) | Cod sursa (job #1056273) | Cod sursa (job #1842142)
#include<fstream>
#include<unordered_set>
using namespace std;
unordered_set<int> S;
int n,x,y;
int main(){
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
while(n--){
scanf("%d %d",&x,&y);
if(x==1) S.insert(y);
if(x==2) if( S.find(y) != S.end() ) S.erase( S.find(y) );
if(x==3) printf("%d\n",( S.find(y) != S.end() ));
}
return 0;
}