计算1000的阶乘求能计算大数阶乘的程序,最好有源代码...aini24680。但是代码编译不通过啊。我补上#include 也不行

计算1000的阶乘求能计算大数阶乘的程序,最好有源代码...aini24680。但是代码编译不通过啊。我补上#include 也不行
计算1000的阶乘
求能计算大数阶乘的程序,最好有源代码...
aini24680。但是代码编译不通过啊。
我补上#include 也不行

计算1000的阶乘求能计算大数阶乘的程序,最好有源代码...aini24680。但是代码编译不通过啊。我补上#include 也不行
Windows用户下载Python,Python是一种脚本语言,可进行任意精度的数学计算
以下为Python源码,用TAB或空格替换~
#!/usr/bin/python
def foo(a)
ans = 1
for i in range(1,a+1):
ans*=i
return ans
print foo(1000)

int result = 1;
for(int i = 1;i <= 1000;i++)
{
result = result * i;
}
Console.Write(result);

#define M 20000 /* 最大结果位数，DOS能访问的内存有限，最好不要超过 30000 位*/
#define N (M+5)
main()
{
int Num;
register int i,j,k,flag;
register unsigned int n,m,pc;
unsigned char str_n[5...

全部展开

#define M 20000 /* 最大结果位数，DOS能访问的内存有限，最好不要超过 30000 位*/
#define N (M+5)
main()
{
int Num;
register int i,j,k,flag;
register unsigned int n,m,pc;
unsigned char str_n[5],result_0[N],result_1[N];
void fun_print_result(char *result,int flag);
int fun_mul(char *a,char *b,char *c,int flag);
printf("输入计算其阶乘的数：Num = ");
scanf("%d",&Num);
if(Num >= 100)
{
printf("\n正在进行阶乘运算. . .\n");
printf("已完成 00000 的阶乘，请等待. . .");
}
for (j=0;j{
result_1[j] = 0; result_0[j] = 0;
}
result_1[N-1] = 1;
for(i=0;i<5;i++)
{
str_n[i] = 0;
}
n = 1;
pc = 0; flag = N-1;
while (n <= Num)
{
m = n;
k = 4;
while(m > 0)
{
str_n[k] = m%10; m /= 10; k--;
}
if (pc%2 == 0)
{
if(fun_mul (str_n,result_1,result_0,flag) != 1)
{
printf("\n\n结果溢出！当前所设置的最大结果为 %d 位 已完成 %d 的阶乘",M,pc);
exit(0);
}
}
else
{
if(fun_mul (str_n,result_0,result_1,flag) != 1)
{
printf("\n\n结果溢出！当前所设置的最大结果为 %d 位 已完成 %d 的阶乘",M,pc);
exit(0);
}
}
flag = flag-(4-k); /* flag 标记相乘后“可能的”第一个有效数字的标号 */
if(pc%2 == 0) /* 再处理一次使 flag 正好标记第一个有效数字的标号 */
{
if(result_0[flag] == 0) flag++;
}
else
{
if(result_1[flag] == 0) flag++;
}
n++; pc++;
if((pc)%25 == 0 && Num >= 100 && pc >= 100)
{
printf("\r已完成 %5d",pc);
}
}
if(Num >= 100) printf("\n");
if ((pc-1)%2 == 0)
{
fun_print_result (result_0,flag);
}
else
{
fun_print_result (result_1,flag);
}
}
int fun_mul(char *a,char *b,char *c,int flag) /* 相乘函数 */
{
register int i,j;
for(j=flag;jfor(i=4;i>=0;i--)
{
if(a)
{
for (j=N-1;j>=flag;j--)
{
if(b[j])
{
c[i+j-4] += a[i]*b[j];
}
if(c[i+j-4] > 9)
{
c[i+j-5] += c[i+j-4]/10; c[i+j-4] %= 10;
}
}
}
}
if(flag < 10)
{
if (c[0] || c[1] || c[2] || c[3] || c[4]) /*** 结果溢出判断 ***/
{
return 0;
}
}
return 1;
}
void fun_print_result(char *result,int flag) /* 输出结果函数 */
{
int p;
printf("\n本次计算结果共有 %d 位，如下：\n\n",N-flag);
for(p=flag;p{
printf("%d",result[p]);
if((p+1-flag)%(21*80) == 0)
{
printf("\n计算结果太长，请按任一键看下一屏，Esc 退出");
if(getch() == 27)
{
clrscr(); exit(0);
}
clrscr();
}
}
printf("%d",result[N-1]);
printf("\n\n[OK]");
}
算出来1000的阶乘为：
本次计算结果共有 2568 位，如下：
402387260077093773543702433923003985719374864210714632543799910429938512398629020592044208486969404800479988610197196058631666872994808558901323829669944590997424504087073759918823627727188732519779505950995276120874975462497043601418278094646496291056393887437886487337119181045825783647849977012476632889835955735432513185323958463075557409114262417474349347553428646576611667797396668820291207379143853719588249808126867838374559731746136085379534524221586593201928090878297308431392844403281231558611036976801357304216168747609675871348312025478589320767169132448426236131412508780208000261683151027341827977704784635868170164365024153691398281264810213092761244896359928705114964975419909342221566832572080821333186116811553615836546984046708975602900950537616475847728421889679646244945160765353408198901385442487984959953319101723355556602139450399736280750137837615307127761926849034352625200015888535147331611702103968175921510907788019393178114194545257223865541461062892187960223838971476088506276862967146674697562911234082439208160153780889893964518263243671616762179168909779911903754031274622289988005195444414282012187361745992642956581746628302955570299024324153181617210465832036786906117260158783520751516284225540265170483304226143974286933061690897968482590125458327168226458066526769958652682272807075781391858178889652208164348344825993266043367660176999612831860788386150279465955131156552036093988180612138558600301435694527224206344631797460594682573103790084024432438465657245014402821885252470935190620929023136493273497565513958720559654228749774011413346962715422845862377387538230483865688976461927383814900140767310446640259899490222221765904339901
计算结果太长，请按任一键看下一屏，Esc 退出886018566526485061799702356193897017860040811889729918311021171229845901641921068884387121855646124960798722908519296819372388642614839657382291123125024186649353143970137428531926649875337218940694281434118520158014123344828015051399694290153483077644569099073152433278288269864602789864321139083506217095002597389863554277196742822248757586765752344220207573630569498825087968928162753848863396909959826280956121450994871701244516461260379029309120889086942028510640182154399457156805941872748998094254742173582401063677404595741785160829230135358081840096996372524230560855903700624271243416909004153690105933983835777939410970027753472000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

收起

给个JAVA版的源码，我刚写的，用了JAVA自带的类库，无位数限制。
import java.math.BigInteger;
public class BigFactorial {
public static void main(String[] args) {
int testNumber = 100;
BigInteger result = ...

全部展开

给个JAVA版的源码，我刚写的，用了JAVA自带的类库，无位数限制。
import java.math.BigInteger;
public class BigFactorial {
public static void main(String[] args) {
int testNumber = 100;
BigInteger result = new BigInteger("1");
for (int i = 1; i <= testNumber; i++) {
BigInteger tempInteger = new BigInteger("" + i);
result = result.multiply(tempInteger);
}

System.out.println("Result:");
System.out.println(result.toString());
}
}

收起