C :

#include<stdio.h>
int ret(int a[],int n)
{
    int i;
    int t;
    for(i=0;i<(n/2);i++)
    {
        t=a[n-i-1];
        a[n-i-1]=a[i];
        a[i]=t;
    }
    return n;
};
int main()
{
    int ret(int a[],int n);
    int m,b[1000],i;
    scanf("%d",&m);
    for(i=0;i<m;i++)
        scanf("%d",&b[i]);
    ret(b,m);
    for(i=0;i<m;i++)
        printf("%d ",b[i]);
    printf("\n");
    return 0;
}

C++ :

#include <stdio.h>
int main() {
	void reverse(int array[], int n);
	int n, i, array[1000];
	scanf("%d", &n);
	for (i = 0;i < n;i++)
		scanf("%d", &array[i]);
	reverse(array, n);
	for (i = 0;i < n;i++)
		printf("%d ", array[i]);
	printf("\n");
	return 0;
}
/* 反转数组的函数 */
void reverse(int array[], int n) {
	int i, temp;
	for (i = 0;i + i < n;i++) {
		temp = array[i];
		array[i] = array[n - 1 - i];
		array[n - 1 - i] = temp;
	}
}

Pascal :

var
   i,n:longint;
   a:array[1..1000] of longint;
begin
   readln(n);
    for i:=1 to n do read(a[i]);
    for i:=n downto  1 do write(a[i],' ');
    writeln;
end. 

Java :

import java.util.*;

public class Main{
	public static void main (String[] args) {
		Scanner in=new Scanner(System.in);
		int n=in.nextInt();
		int []a=new int[n];
		for(int i=0;i<n;i++)
			a[i]=in.nextInt();
		for(int j=n-1;j>=0;j--)
			System.out.print (a[j]+" ");
		System.out.println ();
	}
}