Background
Description
给定两个非负整数n和m(1<=n<=m<=15),编写函数计算组合数C(n, m)
Format
Input
第一行输入n(1<=n<=15)
第二行输入m(1<=m<=15)
Output
输出组合数C(n, m)的结果值
Samples
输入数据 1
5
2
Copy
输出数据 1
10
Copy
输入数据 2
15
5
Copy
输出数据 2
3003
Copy
Limitation
1s, 1024KiB for each test case.
n = int(input("n:"))
m = int(input("m:"))
r = n - m
# 第一步:自定义阶乘函数,求出n!、m!、r!
def factorial_fun(integer):
if integer == 1:
return 1
return integer * factorial_fun(integer-1)
n_factorial = factorial_fun(n)
m_factorial = factorial_fun(m)
r_factorial = factorial_fun(r)
# 第二步:应用公式求出组合数
combinatorial_number = n_factorial / (m_factorial * r_factorial)
print(int(combinatorial_number))