C :

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

C++ :

#include <stdio.h>
#include <stdlib.h>
struct node {
	int num;
	struct node * next;
};
int main() {
	struct node *head, *tail, *newhead, *p, *pa;
	int n, i;
	scanf("%d", &n);
	/* 读入a链表中的n个人的信息 */
	head = tail = NULL;
	for (i = 0;i < n;i++) {
		p = (struct node *)malloc(sizeof(struct node));
		scanf("%d", &p->num);
		if (head == NULL) {
			head = tail = p;
		} else {
			tail->next = p;
			tail = p;
		}
	}
	tail->next = NULL;
	/* 遍历链表的每一个节点，将其添加到新的逆序链表的最前端 */
	newhead = NULL;
	p = head;
	while (p != NULL) {
		pa = p->next;
		if (newhead == NULL)
			p->next = NULL;
		else
			p->next = newhead;
		newhead = p;
		p = pa;
	}
	/* 将处理后的链表进行输出 */
	p = newhead;
	while (p != NULL) {
		printf("%d\n", p->num);
		p = p->next;
	}
	return 0;
}

Pascal :

var a:array [1..100] of integer;
    n,i:integer;
begin
  readln(n);
  for i:=1 to n do readln(a[i]);
  for i:=n  downto 1 do writeln(a[i]);
end.

Java :

import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;

public class Main {
   private static Scanner s = new Scanner(System.in) ;
   public static void main(String[] args) {
      int num = s.nextInt() ;
      List<Integer> list = new LinkedList<Integer>() ;
      if(num<=100){
      for (int i = 0; i < num; i++) {
		list.add(s.nextInt()) ;
	  }
      for (int i = list.size()-1; i >=0 ; i--) {
		 System.out.println(list.get(i));
	  }
      }
   }
}