← Questions
Maximum XOR product
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a, b and n, choose x with 0 <= x < 2^n to maximize (a XOR x) * (b XOR x), returned modulo a large prime. Explain the bit-by-bit greedy that keeps the two factors as close as possible. Only the title of this report was public; the details follow the common version.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Write and test your solution herePython in your browser, the question's tests level by level, saved for you.Sign in to start coding