Cod sursa(job #3130727)
Utilizator | Data | 18 mai 2023 14:46:12 | |
---|---|---|---|
Problema | Hashuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.74 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
const unsigned long long int MAX = 749999979;
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% 749999979] = true;
}
else if (x == 2)
{
fr[y% 749999979] = false;
}
else if (x == 3)
{
if (fr[y% 749999979])
{
g << "1" << '\n';
}
else
{
g << "0" << '\n';
}
}
}
return 0;
}