Pagini recente » Cod sursa (job #2021710) | Cod sursa (job #1774969) | Cod sursa (job #1060046) | Cod sursa (job #1364640) | Cod sursa (job #3149366)
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n, t;
unordered_map <int, int> m;
int main() {
fin >> n;
for (int i = 1; i <= n; i++) {
int x;
fin >> t >> x;
if (t == 1)
m[x] = 1;
else if (t == 2)
m[x] = 0;
else
if (m[x] == 1)
fout << "1\n";
else
fout << "0\n";
}
return 0;
}