Cod sursa(job #2823190)
| Utilizator | Data | 27 decembrie 2021 15:34:02 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
const int nmax=1000000;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map <int, bool> 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]=1;
}else if(x==2){
um[y]=0;
}else{
if(um[y]==0){
fout<<"0\n";
}else{
fout<<"1\n";
}
}
}
return 0;
}
