C :

#include<stdio.h>
int main(){
int a[200];
int n,i;
scanf("%d",&n);
  for(i=0;i<n;i++){
    if(i==0 || i==1)
      a[i]=1;
    else
      a[i]=a[i-1]+a[i-2];
    }
  for(i=0;i<n;i++){
    if(i%5==0 && i!=0)
      printf("\n");
    printf("%12d",a[i]);
  }
  printf("\n");
return 0;
}

C++ :

#include <stdio.h>
int main() {
	int n, i;
	int f[40] = {1, 1};
	scanf("%d", &n);
	for (i = 2;i < n;i++)
		f[i] = f[i - 2] + f[i - 1];
	for (i = 0;i < n;i++) {
		printf("%12d", f[i]);
		if ((i + 1) % 5 == 0) puts("");
	}
	puts("");
	return 0;
}

Pascal :

var
  a:array[1..50] of longint;
  i,n:longint;
begin
  a[1]:=1; a[2]:=1;
  for i:=3 to 40 do a[i]:=a[i-2]+a[i-1];
  readln(n);
  for i:=1 to n do begin
    write(a[i]:12);
    if(i mod 5=0) then writeln;
  end;
end.

Java :

import java.util.Scanner;


public class Main {
	public static void main(String[] args) {
		int  m=1,n=1,result=0;
		Scanner cin = new Scanner(System.in);
		int cishu2  = cin .nextInt();
		int cishu = 0 ;
		while(true)
		{
			if( cishu == 0 || cishu ==1 )
			{
				System.out.printf("%12d",1);
				cishu ++;
			}
			else
			{
				cishu++;
				result = m+n;
				System.out.printf("%12d",result);
				int temp = 0 ;
				m = n ;
				n = result; 
				if( cishu % 5 == 0 )System.out.println();
				
			}
			if( cishu == cishu2 )break;
		}

	}

}