hdu-大数的阶乘

N!

Time Limit : 10000/5000ms (Java/Other)???Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 65???Accepted Submission(s) : 18

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

Problem Description

Input

Output

Sample Input

1
2
3

Sample Output

1
2
6

Author

#include <iostream>
#define N 35662
using namespace std;
int main()
{
    int n,p,q,k,i,j,l,t;

    while(cin>>n)
    {
        int s[N]={0};
        s[0]=1;
        t=1;
        for(i=2;i<=n;i++)
        {
            q=0;
            for(j=0;j<t;j++)
            {
                p=s[j]*i+q;
                s[j]=p%10;
                q=p/10;
            }
            while(q)  
           {
            s[t++]=q%10;
            q/=10;
           }
        }



        for(k=t-1;k>=0;k--)
        cout<<s[k];
        cout<<endl;
    }
    return 0;
}

#include <iostream>
#include <cstring>
using namespace std;
int a[100000],b[200000];
int main()
{
    int n,t,s,j;

    while(cin>>n)
    {
       if(n==1||n==0)
       cout<<'1'<<endl;
       else
       {
           memset(b,sizeof(b));
           t=1;
           a[0]=1;
           for(i=2;i<=n;i++)
           {
               p=0;
            for(j=0;j<t;j++)
            {
               s=a[j]*i+p;
               p=s/10;
               b[j]=s%10;
               a[j]=b[j];
            }
           while(p)
           {
               b[t]=p%10;
               a[t]=b[t];
               t++;
               p/=10;
           }
           }
           for(l=t-1;l>=0;l--)
           cout<<b[l];
           cout<<endl;
       }


    }

    return 0;
}