Pagini recente » Cod sursa (job #1107877) | Cod sursa (job #1618313) | Cod sursa (job #1632638) | Cod sursa (job #1108641) | Cod sursa (job #3285862)
#include <iostream>
#include <random>
#include <fstream>
#include <stack>
#include <bitset>
#include <unordered_map>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map<int,bool> M;
int main()
{
int n;
fin >> n;
for (int i = 1; i <= n; i++)
{
int q;
fin >> q;
int x;
fin >> x;
if (q == 1)
M[x] = 1;
else if (q == 2)
M[x] = 0;
else
fout << M[x] << '\n';
}
return 0;
}