Cod sursa(job #3129374)
Utilizator | Tilica Gabriel Lucian ZiGabiZi | Data | 14 mai 2023 04:19:59 |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.83 kb |
#include <iostream>
#include <unordered_map>
#include <fstream>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int main()
{
int n,aux,aux2,k=0;
f >> n;
unordered_map<int, int> h;
while (k < n) {
f >> aux >> aux2;
switch (aux) {
case 1:
if (h.count(aux2) == 0) {
h[aux2] = 1;
}
break;
case 2:
if(h.count(aux2) == 1)
h.erase(aux2);
break;
case 3:
if(h.count(aux2) == 1)
g << 1 << endl;
else if (h.count(aux2)==0)
g<< 0 <<endl;
break;
}
k++;
}
f.close();
g.close();
return 0;
}