C :

#include<stdio.h>
int main()
{
	int n,i ,j;
	scanf("%d",&n);
	int a[n][n];
	for(i=0;i<n;i++){
		a[i][0]=1;
		for(j=1;j<=n-i-1;j++){
			a[i][j]=a[i][j-1]+1;
		}
		for(j=n-i;j<n;j++){
			a[i][j]=a[i][j-1];
		}
	}
	for(i=0;i<n;i++){
		for(j=0;j<n;j++){
			printf("%3d",a[i][j]);
		}
		printf("\n");
	}




return 0;
}

C++ :

#include<bits/stdc++.h>
using namespace std;
int a[110][110];
int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		for(int j=i;j<n;j++)
		{
			for(int k=0;k<n-i;k++)
			{
				a[k][j]++;
			}
		}
	} 
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
		{
			cout<<setw(3)<<a[i][j];
		}
		cout<<endl;
	}
	return 0;
}

Pascal :

var i,n:longint;

function max(a,b:longint):longint;
begin
  if(a>b)then exit(a);
  exit(b);
end;

begin
  readln(n);
  for i:=1 to n*n do begin
    write(n-max(n-((i-1) mod n+1),(i-1) div n):3);
    if(i mod n = 0)then
      writeln;
  end;
end.

Java :

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc= new Scanner(System.in);
		int b= sc.nextInt();
		int[][] a =new int[b][b];
				
		for(int n=0;n<b;n++){
			for(int m=0;m<b;m++){
				if(m+1<b-n){
					System.out.printf("%3d",m+1);
				}
				if(m+1>=b-n){
					System.out.printf("%3d",b-n);
				}
			}
			System.out.println("");
		}
		
		
	}

}

Python :

n = int(input())
a = [[0 for j in range(n)] for i in range(n)]

for i in range(n):
    # 先定好第一列数字
    a[i][0] = 1
    for j in range(1, n - i):
        a[i][j] = a[i][j - 1] + 1
    for j in range(n - i, n):
        a[i][j] = a[i][j - 1]

for i in range(n):
    for j in range(n):
        print('%3d' % a[i][j], end='')
    print()