PE-CN / pe-cn-comments

2 stars 0 forks source link

Problem 810 | Project Euler | #812

Open sx349 opened 2 years ago

sx349 commented 2 years ago

https://pe-cn.github.io/810/

Problem 810 XOR-PrimesWe use $x\oplus y$ for the bitwise XOR of $x$ and $y$. Define the XOR-product of $x$ and $y$, denoted by $x \otimes y$, similar to a long multiplication in base $2$, except that