Cod sursa(job #1686244)
| Utilizator | Data | 12 aprilie 2016 09:55:57 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <map>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
map < int, int > M;
int n, a, b, i, nr;
int main()
{
fin>>n;
for (i=1; i<=n; i++)
{
fin>>a>>b;
if (a==1 && M.find(b)==M.end())
M[b] = ++nr;
if (a==2)
M.erase(b);
if (a==3)
{
if (M.find(b)==M.end())
fout<<0<<'\n';
else
fout<<1<<'\n';
}
}
return 0;
}
