def Fact(n):
res = 1
for i in range(1,n+1):
res *= i
return res
def Comb(m,n):
return Fact(n)//(Fact(m)*Fact(n-m))
m = int(input('请输入一个正整数m:'))
n = int(input('请输入一个正整数n(n>m):'))
print(Comb(m,n))
dzydzy7的博客#include <iostream> using namespace std; long long factorial(int n) { long long m = 1; for (int i = 1;...= n;... m *= i;... return m;...long long C(int n, int m) { return factorial(n)...
转进如风酸一峰的博客编写一个函数fun,求p=m!/n!(m-n)!的值,其中m与n为两个正整数,且要求m&gt; #include &lt;stdio.h&gt; int fac(int n); int fun(int m, int n); void main() { int m, n; while ...