Pagini recente » Cod sursa (job #2020288) | Cod sursa (job #2006929) | Cod sursa (job #3193006) | Cod sursa (job #690645) | Cod sursa (job #1279849)
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
unordered_map <int> mymap;
int main()
{
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n, i, op, x;
f>>n;
for (i=0;i<n;i++)
{
f>>op>>x;
if (op==1) mymap.insert(x);
if (op==2) mymap.erase(x);
if (op==3) if (mymap.find(x)!=mymap.end()) g<<"1\n"; else g<<"0\n";
}
}