计算排列数A(m, n)

╰+攻爆jí腚メ 2023-01-17 03:22 227阅读 0赞

#include<stdio.h>
    unsigned long f(unsigned short m, unsigned short n);
    int main()
    {
        /* 考虑到用户可能输入负数, 将m、n声明为short类型更稳妥 */
        /* 虽然f函数的两个参数均为unsigned short类型, 但实际最大值 = short类型的最大正数值 */
        short m;
        short n;
        /* 考虑到排列数可能较大, 用unsigned long类型声明更合适 */
        unsigned long result;
        /* 输入容错机制 */
        while(scanf("%hd%hd", &m, &n) != 2 || m < 1 || n < 0)
        {
            while(getchar() != '\n') ;
            printf("请输入合法数据.\n");
        }
        result = f(m, n);
        if(result != 0)
        {
            printf("A(%hd, %hd) = %lu.\n", m, n, result);
        }
        else
        {
            /* 数据不合法 */
            printf("A(m, n): m >= n!\n");
        }
        /* */
        return 0;
    }
    /* 计算A(m, n) */
    unsigned long f(unsigned short m, unsigned short n)
    {
        /* 数据不合法 */
        if(n > m)
        {
            return 0;
        }
        /* */
        unsigned long S = 1;
        /* S = m * (m - 1) * (m - 2) * ... * (m - n + 1) */
        unsigned short i = m;
        while(i >= m - n + 1)
        {
            S *= i;
            i --;
        }
        /* 有趣的是, 如果n == 0, 那么循环一次都不执行, 最终结果确实也为1 */
        return S;
    }

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70][]

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 1][]

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70]: /images/20221022/2ffb1901865843fb9914578ea537d362.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjA0ODQ2Mw_size_16_color_FFFFFF_t_70 1]: /images/20221022/7b9bb4fb72294d799a86e7ea7297b6a9.png