Cod sursa(job #1372662)
| Utilizator | Data | 4 martie 2015 14:53:24 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <map>
#define mod 666013
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
map <int, int> M;
int main()
{
int n;
int op, x;
int nr = 0;
fin >> n;
for (; n; --n)
{
fin >> op >> x;
if (op < 2 && (M.find(x) == M.end())) M[x] = ++nr;
else if (op < 3) M.erase(x);
else if (M.find(x) != M.end()) fout << 1 << '\n';
else fout << 0 << '\n';
}
return 0;
}
