Pagini recente » Algoritmiada 2018 Runda Maraton | Diferente pentru utilizator/yato2 intre reviziile 36 si 37 | Numar2 | moft | Cod sursa (job #2155905)
#include <iostream>
#include <fstream>
#include <set>
#include <map>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
int n;
map<int,int>v;
int main()
{
in>>n;
int op,aux = 0;
for(int i = 0; i < n; i++){
int x;
in>>op>>x;
if(op == 1 && v.find(x) == v.end())
v[x] = ++aux;
else if(op == 2)
v.erase(x);
else
out<<(v.find(x) != v.end())<<"\n";
}
return 0;
}