Pagini recente » Cod sursa (job #1214760) | Cod sursa (job #3236268) | Cod sursa (job #2224264) | Cod sursa (job #1697664) | Cod sursa (job #2255987)
#include <fstream>
#include <set>
using namespace std;
const int mod = 666013;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
set<int> s[mod + 2];
int n, cer, x, ok, y;
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
{
fin >> cer >> x;
y = x % mod;
if (cer == 1)
s[y].insert(x);
else if (cer == 2)
s[y].erase(x);
else fout << (s[y].find(x) != s[y].end()) << '\n';
}
fin.close();
fout.close();
return 0;
}