Pagini recente » Cod sursa (job #3038321) | Cod sursa (job #702049) | Cod sursa (job #1434909) | Cod sursa (job #852954) | Cod sursa (job #1808092)
#include <fstream>
#include <map>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
map <int , int> M;
int N, x;
int T;
int nr;
int main()
{
fin >> N;
for (int i = 1; i <= N; i++) {
fin >> T >> x;
if (T == 1 && M.find(x) == M.end())
M[x] = ++nr;
if (T == 2)
M.erase(x);
if (T == 3)
if (M.find(x) != M.end())
fout << 1 << '\n';
else
fout << 0 << '\n';
}
return 0;
}