Pagini recente » Cod sursa (job #1714049) | Cod sursa (job #326464) | Cod sursa (job #965253) | Cod sursa (job #1661153) | Cod sursa (job #1610890)
#include <fstream>
#include <map>
using namespace std;
int main()
{
int operatie, key, nrOperatii;
map<int, int> container;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
in>>nrOperatii;
for( int i = 0; i<nrOperatii; ++i )
{
in>>operatie>>key;
if( operatie == 1 && container.find(key) == container.end())
{
container.insert(pair<int, int>(key, i));
}
else if( operatie == 2 )
{
container.erase(key);
}
else if( operatie == 3 )
{
out<<( container.find(key) != container.end() )<<endl;
}
}
return 0;
}