Pagini recente » Cod sursa (job #880421) | Cod sursa (job #749234) | Cod sursa (job #949131) | Cod sursa (job #26081) | Cod sursa (job #2910407)
#include <cstdio>
#include <map>
#include <iostream>
//#include <unordered_map>
using namespace std;
FILE *fin, *fout;
map <int, int> ht;
int main()
{
fin = fopen("hashuri.in", "r");
fout = fopen("hashuri.out", "w");
//pair<int , int> p;
int n;
fscanf(fin, "%d", &n);
int i;
int op, nr;
for(i = 1; i <= n; i++)
{
fscanf(fin, "%d %d", &op, &nr);
if(op == 1)
{
if(ht.find(nr) == ht.end())
ht[nr] = nr;
}
else if(op == 2)
{
if(ht.find(nr) != ht.end())
ht.erase(nr);
}
else if(op == 3)
{
if(ht.find(nr) != ht.end())
fprintf(fout, "%d\n", 1);
else fprintf(fout, "%d\n", 0);
}
}
return 0;
}