Pagini recente » Borderou de evaluare (job #369459) | Suffix array in O(N) | Cod sursa (job #2237653) | Borderou de evaluare (job #2964591) | Cod sursa (job #3160653)
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream cin("hashuri.in");
ifstream cout("hashuri.out");
int main() {
int n;
cin >> n;
unordered_map<int, bool> m;
for (int i = 0; i < n; ++i) {
int p, x;
cin >> p >> x;
if (p == 1) m[x] = true;
else if (p == 2) m[x] = false;
else {
cout << m[x] << '\n';
}
}
return 0;
}