题解 | #牛牛的排列数#
牛牛的排列数
https://www.nowcoder.com/practice/9ca1c236cdbf46da9e08e1f510808625
def f(m,n):
if n == 1:
return m
return m * f(m-1,n-1)
m,n = map(int,input().split())
print(f(m,n))
牛牛的排列数
https://www.nowcoder.com/practice/9ca1c236cdbf46da9e08e1f510808625
def f(m,n):
if n == 1:
return m
return m * f(m-1,n-1)
m,n = map(int,input().split())
print(f(m,n))
相关推荐
贴心的火龙果风度翩翩:公司名字很符合