Pagini recente » Borderou de evaluare (job #2205433) | Cod sursa (job #525102) | Cod sursa (job #1430837) | Cod sursa (job #1478574) | Cod sursa (job #1439557)
#include <iostream>
#include <fstream>
#include <set>
#define P 104729
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
set <int> H[P];
int main()
{
int n, i, v, x, r;
fin >> n;
for (i = 1; i <= n; i++)
{
fin >> x >> v;
r = v % P;
if (x == 1 && H[r].find(v) == H[r].end())
H[r].insert(v);
else if (x == 2)
H[r].erase(v);
else if (x == 3 && H[r].find(v) == H[r].end())
fout << "0\n";
else if (x == 3) fout << "1\n";
}
fout.close();
return 0;
}