• @odium
    link
    710 months ago

    Have you tried seeing if the recursive approach runs faster?

    • @[email protected]
      link
      fedilink
      1310 months ago

      I know an even better way. We can make it run in O(1) by using a lookup table. We only need to store 2^64 booleans in an array first.