Pagini recente » Cod sursa (job #2455915) | Cod sursa (job #2500186) | Cod sursa (job #2170402) | Cod sursa (job #1655340) | Cod sursa (job #2834412)
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
ifstream f ("hashuri.in");
ofstream g ("hashuri.out");
int main()
{
map <int, int> Map;
int n;
f >> n;
for (int i = 1; i <= n; i++)
{
int option, x;
f >> option >> x;
switch (option)
{
case 1:
if (Map.count(x) == false)
{
Map.insert(make_pair(x, 0));
}
break;
case 2:
Map.erase(x);
break;
case 3:
g << (Map.count(x)) << "\n";
break;
}
}
}