Pagini recente » Cod sursa (job #717437) | Cod sursa (job #2306957) | Cod sursa (job #2682774) | Cod sursa (job #849464) | Cod sursa (job #2289671)
#include <fstream>
#include <map>
using namespace std;
const int NMAX = 1000005;
int N;
int app = 0;
int main() {
ifstream iff("hashuri.in");
ofstream off("hashuri.out");
iff >> N;
map<int, int> m;
for (int i = 0; i < N; ++i) {
int t, val;
iff >> t >> val;
if (t == 1) {
if (m.find(val) == m.end()) {
m[val] = ++app;
}
} else if (t == 2) {
m.erase(val);
} else {
if (m.find(val) == m.end()) {
off << 0 << endl;
} else {
off << 1 << endl;
}
}
}
return 0;
}