Pagini recente » Cod sursa (job #2672585) | Cod sursa (job #1183599) | Cod sursa (job #3033295) | Cod sursa (job #1857250) | Cod sursa (job #1686244)
#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;
}