Pagini recente » Cod sursa (job #839673) | Borderou de evaluare (job #1157822) | Borderou de evaluare (job #1518634) | Cod sursa (job #2239809) | Cod sursa (job #1245686)
#include <iostream>
#include <fstream>
#include <unordered_set>
int main()
{
std::ifstream fin("hashuri.in");
std::ofstream fout("hashuri.out");
int N;
fin >> N;
std::unordered_set<long long> set(N);
for (; N; --N) {
int type;
long long nr;
fin >> type >> nr;
if (type == 1)
set.emplace(nr);
else if (type == 2 && set.count(nr))
set.erase(set.find(nr));
else if (type == 3)
fout << (set.count(nr) ? "1\n" : "0\n");
}
fin.close();
fout.close();
return 0;
}