Cod sursa(job #2846919)
| Utilizator | Data | 9 februarie 2022 20:37:18 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <queue>
#include <bitset>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
int a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,S,t,T,x,y,z,ok,nr,C;
bitset <2000000003>has;
int main()
{
in>>n;
for(i=1;i<=n;i++){
cin>>x>>y;
if(x==1) {has[y]=1;}
if(x==2) {has[y]=0;}
if(x==3) {
if(has[y]==1) out<<1;
else out<<0;
}
}
return 0;
}
