hdu 1042 N! （java大数）

N!

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 55306    Accepted Submission(s): 15725

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
  
  

第一次用java做题

import java.util.*;
import java.math.*;

public class Main
{
	public static void main(String args[])
	{
		Scanner cin = new Scanner(System.in);
		int n;
		while(cin.hasNextInt())
		{
			n=cin.nextInt();
			System.out.println(f(n));
		}
	}
	static BigInteger f(int n)
	{
		if(n==0||n==1)
		{
			return BigInteger.valueOf(1);
		}
		return f(n-1).multiply(BigInteger.valueOf(n));
		
	}
}

以上代码已经不能AC，java能搞1000或2000的阶乘，但搞不到10000甚至更大

阶乘的位数不会大于本身的4倍

c++代码：可以AC

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;

const int maxn = 100000;
struct bign
{
    int len, s[maxn];

    bign()
    {
        memset(s, 0, sizeof(s));
        len = 1;
    }

    bign(int num)
    {
        *this = num;
    }

    bign(const char* num)
    {
        *this = num;
    }

    bign operator = (int num)
    {
        char s[maxn];
        sprintf(s, "%d", num);
        *this = s;
        return *this;
    }

    bign operator = (const char* num)
    {
        len = strlen(num);
        for(int i = 0; i < len; i++) s[i] = num[len-i-1] - '0';
        return *this;
    }

    string str() const
    {
        string res = "";
        for(int i = 0; i < len; i++) res = (char)(s[i] + '0') + res;
        if(res == "") res = "0";
        return res;
    }

    bign operator + (const bign& b) const
    {
        bign c;
        c.len = 0;
        for(int i = 0, g = 0; g || i < max(len, b.len); i++)
        {
            int x = g;
            if(i < len) x += s[i];
            if(i < b.len) x += b.s[i];
            c.s[c.len++] = x % 10;
            g = x / 10;
        }
        return c;
    }

    void clean()
    {
        while(len > 1 && !s[len-1]) len--;
    }

    bign operator * (const bign& b)
    {
        bign c;
        c.len = len + b.len;
        for(int i = 0; i < len; i++)
            for(int j = 0; j < b.len; j++)
                c.s[i+j] += s[i] * b.s[j];
        for(int i = 0; i < c.len-1; i++)
        {
            c.s[i+1] += c.s[i] / 10;
            c.s[i] %= 10;
        }
        c.clean();
        return c;
    }

    bign operator - (const bign& b)
    {
        bign c;
        c.len = 0;
        for(int i = 0, g = 0; i < len; i++)
        {
            int x = s[i] - g;
            if(i < b.len) x -= b.s[i];
            if(x >= 0) g = 0;
            else
            {
                g = 1;
                x += 10;
            }
            c.s[c.len++] = x;
        }
        c.clean();
        return c;
    }

    bool operator < (const bign& b) const
    {
        if(len != b.len) return len < b.len;
        for(int i = len-1; i >= 0; i--)
            if(s[i] != b.s[i]) return s[i] < b.s[i];
        return false;
    }

    bool operator > (const bign& b) const
    {
        return b < *this;
    }

    bool operator <= (const bign& b)
    {
        return !(b > *this);
    }

    bool operator == (const bign& b)
    {
        return !(b < *this) && !(*this < b);
    }

    bign operator += (const bign& b)
    {
        *this = *this + b;
        return *this;
    }
};

istream& operator >> (istream &in, bign& x)
{
    string s;
    in >> s;
    x = s.c_str();
    return in;
}

ostream& operator << (ostream &out, const bign& x)
{
    out << x.str();
    return out;
}

//bign f[10005];

int main()
{
    int n;
    while(cin>>n)
    {
        bign ans=1;
        for(int i=1; i<=n; i++)
        {
            ans=ans*i;
        }
        cout<<ans<<endl;
    }
    return 0;
}