Cod sursa(job #2337693)
Utilizator | Data | 6 februarie 2019 17:09:17 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <map>
#include <fstream>
using namespace std;
int main(){
map<int, int> h; int n, op, x;
ifstream fin("hashuri.in"); ofstream fout("hashuri.out"); fin>>n;
for(int i=1; i<=n; i++){
fin>>op>>x;
if(op==3) fout<<(h.count(x)!=0)<<"\n";
else if(op==1) h.insert(make_pair(x, x));
else h.erase(x);}
}