Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- # Кузнечик начинает движение с координаты 1. Во второй задачи с 0.
- #Сколько маршрутов
- n = int(input())
- F = [0] * (n+1)
- F[1] = 1
- F[2] = 1
- for i in range(3, n+1):
- F[i] = F[i-2] + F[i-1]
- print(F[n])
- #Самый ДЕШЕВЫЙ маршрут кузнечика
- n = int(input())
- from random import randint
- price = [0]
- price1 = [randint(1,20) for i in range(n)]
- allprice = price + price1
- print(allprice)
- Cost = [0] * (n+1)
- Cost[1] = allprice[1]
- Cost[2] = allprice[2]
- for i in range(3,n+1):
- Cost[i] = min(Cost[i-1] + allprice[i], Cost[i-2] + allprice[i])
- print(Cost[n])
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement