program raf105;
const
n = 4;
var
a: array[1..n,1..n] of integer;
i,j,sum: integer;
begin
for i:=1 to n do
begin
writeln;
for j:=1 to n do
begin
a[i,j]:= random(1,9);
if i = j then
sum:= sum + a[i,j];
write(a[i,j]:4,' ');
end;
end;
writeln;
writeln;
writeln('Вывод:');
for i:=1 to n do
begin
writeln;
for j:=1 to n do
begin
if i <> j then
a[i,j]:= a[i,j] * sum;
write(a[i,j]:4,' ');
end;
end;
end.
PascalABC 3.4.2
int fac(int n) {
return n ? n*fac(n - 1) : 1;
}
int main()
{
int n;
std::cin >> n;
for (int i = 1; i < n; ++i) {
if (n == fac(i)){
std::cout << i << "! = " << n;
break;
}
}
return 0;
}
Алгоритм не оптимизирован, но для учебных целей сойдет.