直接贴实现了的代码了,C++编写
#include "stdafx.h"
#include <iostream>
#include "string.h"
using namespace std;
#define M 8000
int a[M+1]={0};
int c[M+1]={0};
int main()
{
int i,j,k;
int pointer,N;
int min_pos=0;
int p;
int b[2]={0},t;
int n=100000;
while(cin>>N)
{
p=0;
min_pos=M;
a[M]=1;
for(i=1;i<=N;i++)//对应一个N的值
{
t=i;
pointer=(t/n);//pointer指示最低位所在数组的下标
for(j=pointer;j>=0;j--)
{
b[j]=t%n;
t=t/(n);
}
for(j=pointer;j>=0;j--)
{
for(k=M;k>=min_pos;k--)
{
c[k-(pointer-j)]+=a[k]*b[j]+p;
if(c[k-(pointer-j)]>=(n))
{
p=c[k-(pointer-j)]/(n);
c[k-(pointer-j)]=c[k-(pointer-j)]-(n)*p;
}
else p=0;
}
if(p!=0){min_pos--;c[k-(pointer-j)]+=p;p=0;}
}
memcpy(a,c,(M+1)*sizeof( int));
memset(c,0,(M+1)*sizeof( int));
}
cout<<a[min_pos];
for(i=min_pos+1;i<=M;i++)
{
if(a[i]/10==0) cout<<0000;
else if(a[i]/100==0) cout<<000;
else if(a[i]/1000==0) cout<<00;
else if(a[i]/10000==0) cout<<0;
cout<<a[i];
}
cout<<endl;
}
return 0;
}