Cod sursa(job #1921195)
Utilizator | Andrei Andrei AndreiIstetul | Data | 10 martie 2017 11:42:49 |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <set>
int main()
{
std::set<int> set;
std::ifstream f("hashuri.in");
std::ofstream g("hashuri.out");
int op, x, n;
f >> n;
for (int i = 0; i < n; ++i)
{
f >> op >> x;
switch (op)
{
case 1:
{
set.insert(x);
}
break;
case 2:
{
set.erase(x);
}
break;
case 3:
{
g << set.count(x) << '\n';
}
break;
default:
break;
}
}
return 0;
}