Pagini recente » Cod sursa (job #2427464) | Cod sursa (job #200487) | Cod sursa (job #384746) | Cod sursa (job #313087) | Cod sursa (job #1967069)
#include <fstream>
#include <set>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
const int mod = 666013;
int n, t, i, k, x;
set<int> s[mod];
set<int>::iterator w;
int main() {
for (f >> n; n; n--) {
f >> t >> x; k = x%mod;
if (t == 1)
s[k].insert(x);
else if ((w = s[k].find(x)) != s[k].end()) {
if (t == 2)
s[k].erase(w);
else g << "1\n";
} else if (t == 3) g << "0\n";
}
return 0;
}