Cod sursa(job #1829724)
Utilizator | Data | 15 decembrie 2016 16:21:10 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <unordered_map>
int main()
{
int n,op,arg;
std::ifstream fin("hashuri.in");
std::ofstream fout("hashuri.out");
std::unordered_map<int, bool> test;
fin>>n;
for (int i = 0; i < n; ++i)
{
fin>>op>>arg;
switch(op)
{
case 1:
test[arg] = true;
break;
case 2:
test.erase(arg);
break;
case 3:
fout<<(test.find(arg) != test.end())<<"\n";
break;
}
}
fout.close();
fin.close();
return 0;
}