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. Practice
  2. Algorithms
  3. Implementation
  4. Extra Long Factorials
  5. Discussions

Extra Long Factorials

  • kalidindi_rajeev + 2 comments
    #!/bin/python3

import math
import os
import random
import re
import sys

# Complete the extraLongFactorials function below.
def extraLongFactorials(n):
    cache = {}
    def rec(n):
        if n in cache:
            return cache[n]
        if n == 1:
            return 1
        result = n * rec(n-1)
        cache[n] = result
        return result
    return rec(n)

if __name__ == '__main__':
    n = int(input())

    print(extraLongFactorials(n))
    • ArthurSerafim + 0 comments

      Hey, the way I'm about to show you is not really "algorithmcal", but it works haha

      from math import factorial
def extraLongFactorials(n):
    print(factorial(n))
    • t_payer + 0 comments

      Why the cache?
      Also your dolution doesn't work for 0.
      You could just do: 

      def extraLongFactorials(n):
    return 1 if n == 0 else n * extraLongFactorials(n-1)