该楼层疑似违规已被系统折叠 隐藏此楼查看此楼
我跟她妈研究到 4点50了 最后算的结果 不知道对么 const max=80;
var
i,j,k,n,r:integer;
a,b:array[1..max] of integer;
begin
write('n=');readln(n);
a[1]:=1; writeln('1!=',1);
for j:=1 to n-1 do
begin
b:=a;
for k:=1 to j do
for i:=1 to max do
begin
r:=a[i]+b[i];
if r>=10 then a[i+1]:=a[i+1]+1;
a[i]:=r mod 10;
end;
k:=max;
while a[k]=0 do k:=k-1;
write(j+1,'!=');
for i:=k downto 1 do write(a[i]);
writeln;
end;
end.
最后那计算机算的是 结果93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916864000000000000000000000000
100!前后相邻的质数:
93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916863999999999999999999999729
93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916864000000000000000000000229
100! = 9.33262154439E+157