Pagini recente » Istoria paginii utilizator/baitan_bianca | Cod sursa (job #1378029) | Cod sursa (job #312022) | Cod sursa (job #2671306) | Cod sursa (job #1060938)
#include <fstream>
#include <map>
using namespace std;
ifstream cin("hashuri.in") ;
ofstream cout("hashuri.out") ;
int N, NR;
map <int, int> M;
int main()
{
int op , X ;
cin >> N ;
for(int i = 1; i <= N ; ++ i)
{
cin >> op >> X ;
if(op == 1 && M.find(X) == M.end()) M[X] == ++NR ;
if(op == 2 && M.find(X) != M.end()) M.erase(X);
if(op == 3 )
{
if(M.find(X) != M.end()) cout << 1 << '\n' ;
else cout << 0 << '\n';
}
}
cin.close() ;
cout.close() ;
return 0;
}