Pagini recente » Cod sursa (job #2799161) | Cod sursa (job #284174) | Cod sursa (job #3294078) | Cod sursa (job #3151633) | Cod sursa (job #1172492)
#include <fstream>
#include <map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n,op,x,nr;
map <int, int> M;
int main()
{
f >> n;
for(int i=1; i<=n; i++)
{
f >> op >> x;
if((op == 1) && (M.find(x) == M.end())) M[x] = ++nr;
if (op == 2) M.erase(x);
if (op == 3) g << (M.find(x) != M.end()) << '\n';
}
g.close();
return 0;
}