Cod sursa(job #3005021)
| Utilizator | Data | 16 martie 2023 18:55:38 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n;
unordered_map<int, int>a;
int main()
{
f >> n;
for (int i = 1; i <= n; i++)
{
int q, num;
f >> q >> num;
if (q == 1)
{
a[num] = 1;
}
else if (q == 2)
{
a[num] = 0;
}
else {
if (a[num] == 1)
{
g << 1 << '\n';
}
else {
g << 0 << '\n';
}
}
}
}
