Cod sursa(job #1972247)
Utilizator | Data | 22 aprilie 2017 16:26:24 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <unordered_map>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
unordered_map<int,bool> u;
int main(){
int n, x, y;
in>>n;
for(int i=1; i<=n; i++){
in>>x>>y;
if(x==1)u[y]=true;
else if(x==2)u.erase(y);
else out<<u[y]<<"\n";
}
return 0;
}