C :

#include<stdio.h> 

int main(){ 
	int n,i,j;
	scanf("%d",&n);
	
	int a[n][n]; 
	
	int s = 1; 
	
	for(i = 1;i <= n;i++){
		for(j = 1;j <= n;j++){
			a[i][j] = s; 
			s++; 
		
		} 

	} 
	
	for(i = n;i >= 1;i--){
		for(j = 1;j <= n;j++){
			printf("%3d",a[i][j]); 
		} 
		printf("\n"); 
		
	} 

	return 0; 
	  
} 

C++ :

#include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdio>

using namespace std;

int main(){
    int n,i,j,a[110][110];
    cin>>n;
    for(i=1;i<=n;i++){
    	for(j=1;j<=n;j++){
    		a[i][j]=((i-1)*n)+j;
		}
	}
	for(i=n;i>=1;i--){
		for(j=1;j<=n;j++){
			cout<<setw(3)<<a[i][j];
		}
		
		cout<<endl;
	}
}

Pascal :

var 
   k,j,n,i,m:longint;
begin
  readln(n);
  m:=n*n-n+1;
  k:=m;
  for j:=1 to n do
  begin
    if j<>1 then k:=m-n;
    for i:=1 to n do
    begin
      write(k:3);
      if i=1 then m:=k;
      inc(k);
    end;
    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];
		
		int s=0;
		
		for(int n=0;n<a.length;n++){
			for(int m=0;m<a[n].length;m++){
				a[n][m]=s+1;
				s++;
			}
		}
		
		
		for(int n=a.length-1;n>=0;n--){
			for(int m=0;m<a[n].length;m++){
				System.out.printf("%3d",a[n][m]);
			}
			System.out.println("");
		}
		
		
	}

}

Python :

n = int(input());
def getArray(m,n):
    '''
    :param m:  行
    :param n:  列
    :return:   m行n列的二维数组
    '''
    array = [[0for i in range(n)] for i  in range(m)];
    return array;

x = getArray(n,n);
k = 1
for i in range(len(x)-1,-1,-1):
    for j in range(0,len(x[i])):
        x[i][j] = k;
        k += 1



#打印二维数组的代码
for i in x:
    for j in i:
        print('%3d'%(j),end='')
    print()