Pagini recente » Cod sursa (job #2641655) | Borderou de evaluare (job #1661106) | Cod sursa (job #874751) | Borderou de evaluare (job #2542106) | Cod sursa (job #2575479)
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int t,x,i,n;
unordered_map <int,int> h;
int main(){
fin>>n;
for(i=1;i<=n;i++){
fin>>t>>x;
if(t==1){
h[x]++;
}
else if(t==2){
if(h[x]!=0)
h[x]--;
}
else{
if(h[x])
fout<<1<<'\n';
else
fout<<0<<'\n';
}
}
return 0;
}