问题同上，谁给个思路
   

不知道什么数量级，姑且用数组先弄吧。

http://acm.hdu.
N!
Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 31926    Accepted Submission(s): 8822


Problem Description
Given an integer N(0 ≤ N ≤ 10000), your task is to calculate N!

 

Input
One N in one line, process to the end of file.

 

Output
For each N, output N! in one line.

 

Sample Input
1
2
3
 

Sample Output
1
2
6
 

Author
JGShining（极光炫影）
 

一万或者十万进制去优化即可

#include<stdio.h>
void Fact(int n)
{
    int a[20000] = {1},f,i,j,len = 1;
    for(i = 2;i<=n;i++)
    {
        for(f = 0,j = 0;j<len;j++)
        {
            if(!(a[j] || f))continue;
            a[j] = a[j]*i + f;
            f = a[j]/10000;
            a[j] %= 10000;
        }
        if(f)a[len++] = f;
    }
    printf("%d",a[--len]);
    while(len--)printf("%04d",a[len]);
    printf("\n");
}
int main(void)
{
    int n;
    while(~scanf("%d", &n))
        Fact(n);
    return 0;
}

谢谢内蒙古包头的那位MM

我是男性 纯爷们。。。。。。。。。。。。。。=

晕！～！不好意思

哈哈哈老杨

帮你瞅瞅！

先看看数量级