Project Euler #25: N-digit Fibonacci number

  • + 4 comments

    A fact: There exists a algorithm with time complexity linear to the no of testcases ie. O(1) per input.