Cod sursa(job #1460112)
Utilizator | Data | 11 iulie 2015 16:35:58 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map<int, bool> S;
int main() {
int n, t, a;
fin>>n;
while(n--) {
fin>>t>>a;
switch(t) {
case 1: S[a] = 1; break;
case 2: S.erase(a); break;
case 3: fout<<(S.find(a) != S.end())<<'\n'; break;
}
}
return 0;
}