[Hacker Rank] Extra Long Factorials

Extra Long Factorials

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;

class Result {

/*
* Complete the 'extraLongFactorials' function below.
*
* The function accepts INTEGER n as parameter.
*/

public static void extraLongFactorials(int n) {
BigInteger bi = BigInteger.ONE;
for(int i = 1; i <= n; i++)
bi = bi.multiply(new BigInteger(String.valueOf(i)));

System.out.println(bi.toString());

}

}

public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

int n = Integer.parseInt(bufferedReader.readLine().trim());

Result.extraLongFactorials(n);

bufferedReader.close();
}
}

Author: Song Hayoung
Link: https://songhayoung.github.io/2022/04/01/PS/HackerRank/extra-long-factorials/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.