题解 | 牛牛的排列数
牛牛的排列数
https://www.nowcoder.com/practice/9ca1c236cdbf46da9e08e1f510808625
#include <stdio.h>
int rank(int m,int n){
if(m==1){
return n;
}
return rank(m-1,n-1)*n;
}
int main() {
int m,n;
scanf("%d %d",&n,&m);
int end=rank(m,n);
printf("%d",end);
return 0;
}
