<swustoj>?id=80 计算n!

链接http://acm.swust.edu.cn/problem/0080/

#include <stdio.h>//递归
int factorial(int n)
{
    if(n==1)
    {
        return 1;
    }
    else
    {
        return n*factorial(n-1);
    }
}
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        if(n<0||n>12)
        {
            printf("shuruwuxiao!\n");
        }
        else
        {
            printf("%d\n",factorial(n));
        }
    }
    return 0;
}

#include <stdio.h>//非递归
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        if(n<0||n>12)
        {
            printf("shuruwuxiao!\n");
        }
        else
        {
            int factorial=1;
            for(int i=1;i<=n;i++)
            {
                factorial*=i;
            }
            printf("%d\n",factorial);
        }
    }
    return 0;
}

 

转载于:https://www.cnblogs.com/niconiconi/p/5720543.html