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