M = {a1, a2, ..., an}. , n M, .
, n :
, .
{fact.pas
Algorithm (http://www.algorithm1.narod.ru/)
: Galina}
uses Crt;
var n1, f : longint;
Procedure Factorial(n : integer; var f : longint);
var i : integer;
begin
f := 1;
if n = 0 then f := 1
else for i := 1 to n do f := f*i
end;
begin
write(' : ');
readln(n1);
Factorial(n1, f);
writeln(' : ', f)
end.
