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