Factorial of a Number

Easy Numbers

Compute the factorial of a number n (the product of all integers from 1 to n).

Sample input

Sample output

120

Solution

def factorial(n):
    result = 1
    for i in range(2, n + 1):
        result *= i
    return result

print(factorial(5))

function factorial(n) {
  let result = 1;
  for (let i = 2; i <= n; i++) result *= i;
  return result;
}

console.log(factorial(5));

public class Main {
    static long factorial(int n) {
        long result = 1;
        for (int i = 2; i <= n; i++) result *= i;
        return result;
    }

    public static void main(String[] args) {
        System.out.println(factorial(5));
    }
}

fun factorial(n: Int): Long {
    var result = 1L
    for (i in 2..n) result *= i
    return result
}

fun main() {
    println(factorial(5))
}

func factorial(_ n: Int) -> Int {
    var result = 1
    if n >= 2 {
        for i in 2...n { result *= i }
    }
    return result
}

print(factorial(5))

int factorial(int n) {
  int result = 1;
  for (int i = 2; i <= n; i++) result *= i;
  return result;
}

void main() {
  print(factorial(5));
}

#include <iostream>
using namespace std;

long long factorial(int n) {
    long long result = 1;
    for (int i = 2; i <= n; i++) result *= i;
    return result;
}

int main() {
    cout << factorial(5) << endl;
    return 0;
}

#include <stdio.h>

long long factorial(int n) {
    long long result = 1;
    for (int i = 2; i <= n; i++) result *= i;
    return result;
}

int main() {
    printf("%lld\n", factorial(5));
    return 0;
}