In [5]:
#!/usr/bin/env python3
import sys
def minimalni_cas(startovni_patro, cilove_patro, patro_vytahu, cas_na_patro):
"""TODO: Uprav tuto funkci"""
if startovni_patro == cilove_patro:
return 0
return (abs(patro_vytahu-startovni_patro)+abs(startovni_patro-cilove_patro))*cas_na_patro
# Načítání vstupu
def precti_vstup():
pocet_problemu = int(input())
for _ in range(pocet_problemu):
startovni_patro, cilove_patro, patro_vytahu, cas_na_patro = map(int, input().split())
reseni = minimalni_cas(startovni_patro, cilove_patro, patro_vytahu, cas_na_patro)
print(f"{reseni}\n")
precti_vstup()
0
1
In [6]:
5*4*3*2*1
Out[6]:
120
In [7]:
10*9*8*7*6*5*4*3*2*1
Out[7]:
3628800
$n^n - n!$
In [9]:
from math import factorial
In [13]:
10**10-factorial(10)
Out[13]:
9996371200
generujeme postupnosti 1,2,3 tak aby neboli tri rozne vedla seba
- prehľadávanie s návratom
backtrack - dynamické programovanie
dznamic programming
In [ ]: