Cod sursa(job #2468677)
| Utilizator | Data | 5 octombrie 2019 19:28:56 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#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;
scanf("%d ", &n);
for(int i=1;i<=n;i++){
scanf("%d%d ", &x,&y);
switch(x){
case 1:
m[y]=1;
break;
case 2:
m[y]=0;
break;
case 3:
if(m[y]==1)
printf("%d\n",1);
else
printf("%d\n",0);
break;
}
}
return 0;
}
