FilesExpand file tree

 master

/

nFactorial.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

43 lines (36 loc) · 1.26 KB

 master

/

nFactorial.java

Copy path

Top

File metadata and controls

• Code
• Blame

43 lines (36 loc) · 1.26 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

import java.math.BigInteger;

import java.util.Scanner;

public class nFactorial {

public static void main(String[]args) {

int n = 0;

Scanner sc = new Scanner(System.in);

boolean invalidCheck = false;

System.out.println("Enter an integer number to display the n factorial for: ");

while (!invalidCheck) {

String line = sc.nextLine();

try {

n = Integer.parseInt(line);

if (n > 0) {

invalidCheck = true;

} else {

System.out.print("Input must be a positive integer greater than zero, please re-enter.\n");

}

} catch (NumberFormatException e) {

System.out.print("Input must be a positive integer greater than zero, please re-enter.\n");

}

}

sc.close();

System.out.println("n Factorial for " + n + ":\n" + calculateFactorial(n));

}

private static BigInteger calculateFactorial(int n){

BigInteger N = BigInteger.valueOf(n);

if(n == 1){

N = BigInteger.ONE;

} else {

for(int i = n; i > 1; i--){

N = N.multiply(BigInteger.valueOf(i-1));

}

}

return N;

}

}