Pagini recente » Cod sursa (job #2140295) | Cod sursa (job #883279) | Cod sursa (job #2931774) | Cod sursa (job #2959094) | Cod sursa (job #1891294)
#include <fstream>
#include <set>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
const int mod = 666013;
int n, x, m, t;
set<int> s[mod];
set<int>::iterator w;
int main() {
f >> m;
while (m--) {
f >> t >> x;
n = x%mod;
w = s[n].find(x);
if (t == 1 && w == s[n].end())
s[n].insert(x);
else if (t == 2 && w != s[n].end())
s[n].erase(w);
else if (t == 3)
g << (w != s[n].end()) << '\n';
}
return 0;
}