Cod sursa(job #1510825)
Utilizator | Data | 25 octombrie 2015 17:29:40 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
#include<unordered_map>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n, op, x, nr;
unordered_map <int, int> unmap;
int main()
{
fin>>n;
for (int i=1;i<=n;++i)
{
fin>>op>>x;
if (op == 1 && unmap.find(x) == unmap.end())
unmap[x] = nr++;
if (op == 2)
unmap.erase(x);
if (op == 3)
if (unmap.find(x) != unmap.end())
fout<<1<<'\n';
else fout<<0<<'\n';
}
return 0;
}