Pagini recente » Cod sursa (job #2331786) | Cod sursa (job #2178901) | Cod sursa (job #59464) | Cod sursa (job #1978700) | Cod sursa (job #397094)
Cod sursa(job #397094)
#include<fstream>
# include<map>
using namespace std;
int n,nr;
map <int, int> M;
int main()
{ ifstream f ("hashuri.in");
ofstream g ("hashuri.out");
int i,tip,x;
f>>n;
for(i=1;i<=n;i++)
{
f>>tip>>x;
if ((tip == 1) && M.find(x)==M.end()) M[x]= nr ++;
if (tip == 2) M.erase(x);
if (tip == 3) g<<(M.find(x) !=M.end())<<"\n";
g.close();
f.close();
}
return 0;
}