C :

#include<stdio.h>
int main()
{   
    long long i,n,b,m;
    while(scanf("%lld",&n)!=EOF)
	{ 
		while(n--)
		{
			scanf("%lld",&m);
			b=1;
			for(i=1;i<=m;i++)
				b*=i;
			printf("%lld\n",b);
		}
	}   
  return 0;
}

C++ :

#include <iostream>
#include <cstdio>
using namespace std;

int main()
{
    //freopen("test.in", "r", stdin);
    //freopen("test.out", "w", stdout);
    int n, t;
    cin >> t;
    while (t--) {
        long long sum=1;
        cin>>n;
        for(int i=1; i<=n; i++)
        {
            sum=sum*i;
        }
        cout<<sum<<endl;
    }
    return 0;
}

Pascal :

var i,n,m,j:longint;
    s:qword;
begin
  readln(m);
  for j:=1 to m do
    begin
      readln(n);
      if n=0 then writeln(0)
        else
         begin
           s:=1;
           for i:=1 to n do  s:=s*i;
           writeln(s);
         end;
     end;
end.

Java :

import java.math.BigInteger;
import java.util.Scanner;

public class Main {
	private static Scanner s = new Scanner(System.in) ;
    public static void main(String[] args) {
    	int n = s.nextInt() ;
    	for (int i = 0; i < n; i++) {
			int m = s.nextInt() ;
			System.out.println(f(m));
		}
	}
    
    public static BigInteger f(int m){
    	BigInteger one = new BigInteger("1") ;
    	for (int i = 1; i <= m; i++) {
			BigInteger b = new BigInteger(String.valueOf(i)) ;
			one = one.multiply(b) ;
		}
    	
    	return one ;
    }
}