Pagini recente » Cod sursa (job #2958086) | Cod sursa (job #1572959) | Borderou de evaluare (job #1569368) | Cod sursa (job #1486657) | Cod sursa (job #965819)
Cod sursa(job #965819)
#include <cstdio>
#include <map>
using namespace std;
int N;
map <int, int> M;
int main() {
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
for (scanf("%d", &N); N; --N) {
scanf("%d %d ", &tip, &x);
if (tip == 1 && M.find(x) == M.end()) {
M[x] = N;
continue;
}
if (tip == 2) {
M.erase(x);
continue;
}
printf("%d\n", M.find(X) != M.end());
}
return 0;
}