C :

int main(int argc, char* argv[])
{
  long	double sum,i,a,n;
	while(~scanf("%llf",&n))
	{
		sum=0;a=1;
	  for(i=1;i<=n;i++)
	  { 
		  sum+=a*i;
		   a=a*i;
	  }
	  printf("%.0llf\n",sum);
	}
	return 0;
}

C++ :

#include<iostream>
using namespace std;
long long a[1001];
void fun(int n)
{
  int i;
  a[1]=1;
  a[2]=2;
  for(i=3;i<=n;i++)
    a[i]=a[i-1]*i;
}
int main()
{
  int i,n;
  fun(1000);
  while(cin>>n)
  {
    long long x=0;
    for(i=1;i<=n;i++)
      x+=a[i];
    cout<<x<<endl;
  }
  return 0;
}

Pascal :

const max=10000; 
var i,j,n : integer; 
    sum,fac : array[1..max+1] of integer; 
begin 
    read(n); 
  for i := 1 to max do sum[i] := 0; 
  for i := 1 to max do fac[i] := 0; 
  fac[1] := 1; 
  for i := 1 to n do 
  begin 
    for j := 1 to max do fac[j] := fac[j]*i; 
    for j := 1 to max do 
    begin 
      fac[j+1] := fac[j+1]+fac[j] div 10; 
      fac[j] := fac[j] mod 10; 
    end; 
    for j := 1 to max do sum[j] := sum[j]+fac[j]; 
    for j := 1 to max do 
    begin 
      sum[j+1] := sum[j+1]+sum[j] div 10; 
      sum[j] := sum[j] mod 10; 
    end; 
  end; 
  i := max; 
  while sum[i]=0 do i := i-1; 
  for j := i downto 1 do write(sum[j]); 
  writeln; 
  
 end.

Java :

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() ;
	  long sum = 0 ;
	  long t = 1 ;
	  
	  for (int i = 1; i <= n; i++) {
		  for (int j = 1; j <= i; j++) {
			 t = t*j ;
		  }
		  
		  sum = sum+t ;
		  t = 1 ;
	  }
	  
	  System.out.println(sum) ;
   }
}