#include<iostream>
using namespace std;
#define MAX_DIG 60000 
/* Max digit is 60000 x 2 = 120,000  :) */ 
void main() 
{ 
    unsigned char N[MAX_DIG]; 
    register unsigned int i, j; 
    long int pN, last0 = 0; 
    register unsigned int sum = 0; 
    int times,n; 
	digits[0]=1;
	cin>>times;
	while(times--)
	{
		cin>>n;
		N[0]=1; 
		last0=0;
		pN=0; 
		for (j=2; j<=n; j++) 
		{ 
			sum = 0; 
			for (i=last0; i<=pN; i++) 
			{ 
				sum = sum + N[i] * j; 
				N[i] = sum % 100; 
				sum = sum / 100; 
			} 
			while (sum>0) 
			{ 
				pN++; 
				N[pN] = sum % 100; 
				sum = sum / 100; 
			} 
			while ((N[last0] == 0) && (last0<pN)) 
				last0++; 
		} 
		if(N[pN]<10)
			cout<<pN*2+1<<endl;
		else
			cout<<pN*2+2<<endl; 
	}
	
} 

• Re:这样也tle 郁闷!!!怎么能不超时阿!! (773) first 2003-12-13 19:17:19
  • Re:根据stirling来做 (887) 8013 2003-12-14 10:52:14
    • Re:哦 isee 记起来了,组合数学上那个公式 呵呵 (0) first 2003-12-14 11:40:40
      • Re:AC 呵呵 3ks 8013 (0) first 2003-12-14 14:22:29