题解 | #牛牛的排列数#
牛牛的排列数
https://www.nowcoder.com/practice/9ca1c236cdbf46da9e08e1f510808625
#include<stdio.h>
int A(int n, int m) {
int res = 1;
for (int i = m; i >= 1; i--) {
res *= n; //n × n-1 × n-2 × ... n-m，m就是需要减1的次数
n--;
}
return res;
}
int main() {
int a;
int t = 0;
scanf("%d%d", &a, &t);
int sum = A(a, t);
printf("%d", sum);
}
查看12道真题和解析
