: , Գ , : 0 = 1, 1 = 1, 2 = 0 + 1,...,n = n-2 + n-1.
Գ , , :
program fibon1;
var n, i: integer;
fib, fib1, fib2: longint;
begin
write(i ii : );
readln(n);
fib2:= 1;
fib1:= 1;
for i:= 2 to n do
begin
fib:= fib1 + fib2;
fib2:= fib1;
fib1:= fib;
writeln(Ԓ, i, = , fib:10);
if i mod 10 = 0 then
begin
writeln( i <Enter> );
readln
end;
end;
readln;
end.
, N = 60 , , . , , , , N 45 , Գ .
76.76. . N M . , , . , , , 2 . , 1 , 2 , . , . , .
: , . , 3 3 . , , . ', .
, , , , , , , 4 3, 5 3 . .
䳿 | ij ( ) | ||
1 | |||
1 | |||
1 | |||
2 | |||
2 | |||
2 | |||
2 | |||
2 | |||
2 |
, ( , ), :
1. 1
|
|
2. N + 1 .
3. , , , 2
4. , , , 2 .
, . ҳ , 2 , . :
program Gorinitch;
var k, n, m: integer;
begin
write(ʳ : ); readln(n);
write(ʳ : ); readln(m);
k:= 0;
while n > 0 do { }
begin
if (m mod 2 = 1) or ((n + m div 2) mod 2 = 1) then
begin { 1 }
m:= m + 1;
k:= k + 1;
writeln( ³ 1x: ,n, ,m,x);
end else
while m > 0 do { }
begin { 2 }
m:= m-2;
n:= n+1;
k:= k+1;
writeln( ³ 2 x: ,n, ,m,x);
end;
if m = 0 then
begin { , }
n:= n-2;
k:= k+1;
writeln( ³ 2 : ,n, ,m,x);
end;
end;
writeln( , k); readln;
end.