Pagini recente » Cod sursa (job #2912689) | Cod sursa (job #834420) | Cod sursa (job #186764) | Cod sursa (job #2425398) | Cod sursa (job #1774532)
#include <iostream>
#include <fstream>
#include <map>
#include <vector>
using namespace std;
const int hsize = 100000;
vector < map<unsigned int, bool> > h(hsize);
void remove(unsigned int x) {
int i = x / hsize;
if(h[i].find(x)!=h[i].end()) {
h[i].erase(h[i].find(x));
}
}
void put(unsigned int x) {
int i = x / hsize;
h[i][x] = true;
}
bool get(unsigned int x) {
int i = x / hsize;
return h[i].find(x) != h[i].end();
}
int main() {
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
unsigned int n, op, x;
cin>>n;
for (int i = 0; i < n; i++) {
cin>>op>>x;
if (op == 1) {
put(x);
} else if (op == 2) {
remove(x);
} else {
cout<<get(x)<<"\n";
}
}
}