Cod sursa(job #408810)
Utilizator | Danci Emanuel Sebastian zalman | Data | 3 martie 2010 11:28:50 |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
int main(void)
{
FILE *f = fopen("hashuri.in", "r");
FILE *g = fopen("hashuri.out", "w");
map<int, int> m;
int N, poz = 0, op, x;
fscanf(f, "%d", &N);
for(int i = 1; i <= N; ++i)
{
fscanf(f, "%d%d", &op, &x);
if(op == 1 && m.find(x) == m.end())
m[x] = 1;
if(op == 2)
m.erase(x);
if(op == 3)
fprintf(g, "%d\n", m.find(x) != m.end());
}
fclose(f);
fclose(g);
return 0;
}