Pagini recente » Cod sursa (job #287161) | Cod sursa (job #449018) | Cod sursa (job #1227156) | Cod sursa (job #172773) | Cod sursa (job #2609573)
#include <fstream>
#include <set>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n, op, x;
set<int> H[666015];
int main()
{
f >> n;
while(n)
{
f >> op >> x;
switch(op)
{
case 1:
H[x % 666013].insert(x);
break;
case 2:
H[x % 666013].erase(x);
break;
case 3:
if(H[x % 666013].find(x) != H[x % 666013].end())
g << "1\n";
else
g << "0\n";
break;
}
n--;
}
f.close();
g.close();
return 0;
}