FilesExpand file tree

 master

/

BigFactorial.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

53 lines (40 loc) · 1.12 KB

 master

/

BigFactorial.java

Copy path

Top

File metadata and controls

• Code
• Blame

53 lines (40 loc) · 1.12 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

43

44

45

46

47

48

49

50

51

52

53

import java.math.BigInteger;

import java.util.Scanner;

public class BigFactorial {

public static void main(String[] args) {

System.out.println("Program to find factorial of a number\n---");

int num, limit = 200; //recommended limit is 200 for RAM; can be upto 700

Scanner scanner = new Scanner (System.in);

System.out.print("Enter the number: ");

num = scanner.nextInt();

if (num>limit || num< -limit) {

System.out.println("Cannot perform factorial for input greater than or lesser than "+limit+".");

end();

}

scanner.close();

if (num<0) {

num = -num;

System.out.println("-"+num+"! = -"+factorial(num));

end();

//For numbers lesser than zero.

}

else {

System.out.println(num+"! = "+factorial(num));

end();

//For numbers greater than or equal to zero.

}

}

private static Object factorial(int num) {

long n = num;

BigInteger output = new BigInteger("1");

while (n>0) {

output = output.multiply(BigInteger.valueOf(n));

n-=1;

}

return output;

}

private static void end() {

System.out.println("---\nThe Program has ended.");

System.exit(0);

}

}