计算n!可用递归公式如下:

2025-12-17 20:00:39
推荐回答(1个)
回答1:

1.if max try(i+1);
2.sum:=(1+n)*n/2;
3.for i:=1 to n do sum:=sum+a[i];
4.for i:=1 to n do sum:=sum+a[i];
s:=sum/i;
5.for i:=1 to m do
if (a[1] mod i=0) and ......and (a[n] mod i=0) then q:=i;
w:=a[1]/q*a[2]/q*......*a[n];
6.n!
7.i:=a[n];