Cod sursa(job #1808092)
Utilizator | Andrei Dana Evohunt | Data | 17 noiembrie 2016 12:26:30 |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#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;
}