Sort by

recency

|

503 Discussions

|

  • + 0 comments

    For Python3 Platform

    cube = lambda x: x*x*x
    
    def fibonacci(n):
        a = 0
        b = 1
        res = []
        
        for i in range(n):
            res.append(a)
            
            c = a+b
            a = b
            b = c
        
        return res
    
    if __name__ == '__main__':
        n = int(input())
        print(list(map(cube, fibonacci(n))))
    
  • + 0 comments
    cube = lambda x: x**3 
    
    def fibonacci(n):
        # return a list of fibonacci numbers
        first = 0 
        second = 1 
        fibonacci_list = []
        if n==0:
            return []
        elif n==1:
            return [first]
        elif n==2:
            return [first, second]
        else:
            fibonacci_list.append(first)
            fibonacci_list.append(second)
            for i in range(3, n+1):
                num = first + second
                fibonacci_list.append(num)
                first = fibonacci_list[i-2]
                second = fibonacci_list[i-1]
        return fibonacci_list
    
  • + 0 comments

    def fibonacci(n): l = [] [l.append(l[i - 1] + l[i - 2]) if i >= 2 else l.append(i) for i in range(0, n)] return l

  • + 0 comments
        fibo_sequence = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377]
    

    for small range 0<=n<=15 it's easier to just hardcode them lol

  • + 0 comments
    cube = lambda x : x ** 3
    
    def fibonacci(n : int):
        # return a list of fibonacci numbers
        if n == 0:
            return []
        elif n == 1:
            return [0]
        else:
            series = [0,1]
            for num in range(2,n):
                series.append(series[-1] + series[-2])
            return series
    
    if __name__ == '__main__':
        n = int(input())
        print(list(map(cube, fibonacci(n))))