Автор: Bronislav

Bronislav — Tue, 05 Feb 2019 19:22:52 +0000

program Recur4;//pabc.net

//uses PT4;

function CoverFib1(n, Count: integer): (integer, integer);
  
  function Fib1(n: integer): integer;
  begin
    Count += 1;
    if (n = 1) or (n = 2) then
      Result := 1
    else
      Result := Fib1(n - 1) + Fib1(n - 2)
  end;

begin
  Result := (Fib1(n), Count)
end;

begin
  //Task('Recur4');
  ReadSeqInteger(5)
  .Select(x -> CoverFib1(x, 0))
  .ForEach(x -> begin Println(x.Item1, x.Item2) end)
end.

program Recur4;//pabc.net

//uses PT4;

function CoverFib1(n, Count: integer): (integer, integer);

function Fib1(n: integer): integer;

begin

Count += 1;

if (n = 1) or (n = 2) then

Result := 1

else

Result := Fib1(n - 1) + Fib1(n - 2)

end;

begin

Result := (Fib1(n), Count)

end;

begin

//Task('Recur4');

ReadSeqInteger(5)

.Select(x -> CoverFib1(x, 0))

.ForEach(x -> begin Println(x.Item1, x.Item2) end)

end.

Автор: Ayan

Ayan — Sun, 10 Jun 2018 20:36:27 +0000

#include<iostream>
using namespace std;
int fib1(int N) {
	if (N<2)
	return 1;
	else 
	return fib1(N-2)+fib1(N-1);	
}


int main()
{
	int a=5;
	for(int i = 0; i<=a; i++)
	cout<<i+1<<":" <<fib1(i) << endl;
    return 0;
}

#include

using namespace std;

int fib1(int N) {

if (N<2)

return 1;

else

return fib1(N-2)+fib1(N-1);

}

int main()

{

int a=5;

for(int i = 0; i<=a; i++)

cout<<i+1<<":" <<fib1(i) << endl;

return 0;

}

Комментарии: Решаем задачи Абрамян на Паскале. Recur4

Автор: Bronislav

Автор: Ayan