C :

#include<stdio.h>

// 2561327

long long mul(int n){
     long long result = 1;
     for(int i=1;i<=n;i++)
     {
		result *= i;
     }
     return result;
}
int main()
{
    long long s=0;
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
		long long r = mul(i);
		s += r;
    }
    printf("%lld",s);
    
}

C++ :

#include<iostream>
using namespace std;
int main()
{
    unsigned long long n,k,s;
    while(cin>>n)
    {
        k=0;s=0;
        for(int i=1;i<=n;i++)
        {
            k=1;
            for(int j=1;j<=i;j++)
                k=k*j;
            s+=k;
        }        
        cout<<s<<endl;
    }
}

Java :

import java.util.Scanner;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner input = new Scanner(System.in);
		int n = input.nextInt();
		long Sum = 0,Pro;
		for(int i = 1; i <= n ; i ++){
			Pro = 1;
			for(int j = 1; j <= i; j ++){
				Pro *= j;
			}
			Sum += Pro;
		}
		System.out.println(Sum);
	}

}

Python :

def foo(n):
    return reduce(lambda x,y: x*y, range(1,n+1))
n = input()
arr = []
for i in range(1,n+1):
    arr.append(foo(i))
count = 0
for i in range(n):
    count += arr[i]
print count