Pagini recente » Cod sursa (job #386597) | Cod sursa (job #622637) | Cod sursa (job #1812637) | Cod sursa (job #2528692) | Cod sursa (job #2823188)
#include <fstream>
#include <unordered_map>
using namespace std;
const int nmax=1000000;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map <int, int> um;
int main(){
int n;
fin>>n;
for(int i=1;i<=n;i++){
int x,y;
fin>>x>>y;
if(x==1){
um[y]++;
}else if(x==2){
if(um[y]>0){
um[y]--;
}
}else{
if(um[y]>0){
fout<<"1\n";
}else{
fout<<"0\n";
}
}
}
return 0;
}