We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #104: Pandigital Fibonacci ends
  4. Discussions

Project Euler #104: Pandigital Fibonacci ends

Sort by

recency

|

9 Discussions

|

  • supershen
     + 0 comments

    I think the key here is try to avoid bigint, passed all test cases in python3.

  • majd20171998
     + 0 comments

    a, b, k = int(input()), int(input()), int(input()) n = 2 sum1 = a + b while n < 2 * (10 ** 6): n += 1 q = list(str(sum1))

    isthere=True
if (len(q) >= k):

    for i in range(1, k+1):

        if (((str(i) not in q[0:k])) or ((str(i) not in q[-k:]))):
            isthere=False

            break
    if(isthere):

        print(n)
        break


a = b
b = sum1
sum1 += a

    if (n == 2 * (10 ** 6) - 1): print("no solution")

  • majd20171998
     + 1 comment

    run time error LOL a, b, k = int(input()), int(input()), int(input()) n = 2 sum1 = a + b while n < 2 * (10 ** 6): n += 1 q = list(str(sum1))

    isthere=True
if (len(q) >= k):

    for i in range(1, k+1):

        if (((str(i) not in q[0:k])) or ((str(i) not in q[-k:]))):
            isthere=False

            break
    if(isthere):

        print(n)
        break


a = b
b = sum1
sum1 += a

    if (n == 2 * (10 ** 6) - 1): print("no solution")

  • Skyler
     + 0 comments

    anyone done using python?

  • floble
     + 1 comment

    How do I view the output of the testing?