Pagini recente » Cod sursa (job #1913077) | Cod sursa (job #917193) | Cod sursa (job #1119610) | Cod sursa (job #1915025) | Cod sursa (job #3130719)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
const unsigned long long int MAX = 19999933;
vector<bool> fr(MAX + 1, false);
int main() {
unsigned long long int n, i, x, y;
f >> n;
for (i = 0; i < n; i++)
{
f >> x >> y;
if (x == 1)
{
fr[y% 199933] = true;
}
else if (x == 2)
{
fr[y% 199933] = false;
}
else if (x == 3)
{
if (fr[y% 199933])
{
g << "1" << '\n';
}
else
{
g << "0" << '\n';
}
}
}
return 0;
}