Cod sursa(job #3141886)
Utilizator | Sabaila Calin SabailaCalin | Data | 17 iulie 2023 13:22:04 |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <unordered_map>
#include <chrono>
using namespace std;
ifstream f ("hashuri.in");
ofstream g ("hashuri.out");
int main()
{
int n;
unordered_map <int, int> u_m;
f >> n;
for (int i = 1; i <= n; i++)
{
int task, x;
f >> task >> x;
if (task == 1) u_m[x] = 1;
else if (task == 2) u_m[x] = 0;
else g << ((u_m[x] == 1) ? ("1\n") : ("0\n"));
}
return 0;
}