题解 | #牛牛的排列数#

#include <stdio.h>
int permutation(int n, int m) {
    if (m == 1) {
        return n;
    } else {
        return n * permutation(n-1, m - 1);
    }
}
int main() {
    int n, m = 0;
    scanf("%d %d", &n, &m);
    printf("%d", permutation(n, m));
    return 0;
}