Cod sursa(job #1317177)
| Utilizator | Data | 14 ianuarie 2015 17:40:40 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <map>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
map <int, int> Map;
int n, i, a, b, nr;
int main()
{
fin >> n;
for(i = 1; i <= n; i ++){
fin >> a >> b;
if(a == 1)
{
if(Map.find(b) == Map.end())
Map[b] = ++nr;
}
else
if(a == 2)
{
Map.erase(b);
}
else
fout << (Map.find(b) != Map.end()) << '\n';
}
return 0;
}
