Дан рекурсивный алгоритм:
procedure F(n: integer);
begin
writeln(n);
if n > 1 then begin
writeln(n);
F(n-2);
F(n-5)
end
end;
Найдите сумму чисел, которые будут выведены при вызове F(9).
Please enter comments
Please enter your name.
Please enter the correct email address.
You must agree before submitting.

Answers & Comments


More Questions From This User See All

Copyright © 2024 SCHOLAR.TIPS - All rights reserved.