Project Euler #104: Pandigital Fibonacci ends

  • + 0 comments

    you use n just for counting then 2 * (10 6) - 1 is evaluating every time

    for improve that: you can directly start with that big num & decrees it value, up to 2

    or shift that range 2 bit, so only need to check is >0 or not. is this python so, only if n: print("")

    it not give you that much less time, but consume little less than yours