Deret Fibonacci

program Fibonacci

var a, b, c, d, e : interger;
begin
writeln('Masukkan bilangan : '); readln(a);
c:=1;
d:=1;
for b:=1 to a do
        begin
        if (b=1) or (b=2) then
        write (c,' ')
        else
                  begin
                  e:=c+d;
                  c:=d;
                  d:=e;
                  write (e, ' ');
                  end;
          end;
          readln;
end.

Segitiga Pascal

int main ()
int nilai, a, i, j, k;
print("Masukan nilai : ");
scan("%i", &nilai);
for (i=0; i<=nilai; i++);
      for (k=0; k<=((2*nilai)-(2*i)); k++) {
            print(" ");
            }
            for (j=0; j<=i; j++){
                   if (j==0||i==j) {
                       a=1;
                       }
                   else{
                       a=a*(i+1-j)/j;
                       }
            print("\n");
getch();
}

Program Segitiga Pascal

var num:array[1..100] of longint;

i,j,n,batas:integer;

begin

print("Masukkan nilai : ");

readln(n);

num[1]:=1;

writeln(1);

for i:=1 to n do

begin

batas:=(i+1) div 2;

if not odd(i) then

num[batas+1]:=num[batas]*2;

for j:=batas downto 2 do

num[j]:=num[j]+num[j-1];

for j:=1 to batas do

write(num[j],’ ‘);

if not odd(i) then write(num[batas+1],’ ‘);

for j:=batas downto 1 do

write(num[j],’ ‘);

writeln;

end;

end.