Program Fibbonachi Pascal

uses crt;
var i,n : integer;
X : array[1..10000] of longint;

label ulang;

begin

X[1] := 1;
X[2] := 1;
ulang :
clrscr;
write('Suku keberapakah yang akan dicari : '); readln(n);
if n>46 then

begin

clrscr;
write('Jangkauan terlalu jauh, silahkan ulangi !'); readln;
goto ulang;

end;


writeln; writeln(X[1]); writeln(X[2]);

for i:= 3 to n do

begin

X[i] := X[i-1] + X[i-2];
writeln(X[i]);

end;


writeln;writeln('Suku ke ',n,' adalah ',X[n]);
readln;

end.