public static void main(String args[]) {
int n, c, fact = 1;
System.out.println(“Enter an integer to calculate it’s factorial”);
Scanner in = new Scanner(System.in);
n = in.nextInt();
if (n < 0)
System.out.println("Number should be non-negative.");
else {
for (c = 1; c <= n; c++)
fact = fact * c;
System.out.println("Factorial of " + n + " is = " + fact);
}
}
}
import java.util.Scanner;
public class FactorialCalculatorApp {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
int number, factorial;
//Welcome the user and prompt for input
System.out.println("Welcome to the Factorial Calculator");
System.out.print("Enter an integer from 1 to 10: ");
number = sc.nextInt();
//calculate and display factorial value
factorial = calculateFactorial(number);
System.out.println(number + "! = " + factorial);
}//end of main method*/
public static int calculateFactorial(int n) {
int factorial = 1;
for (int i = 2; i <= n; i++) { factorial *= i; } return factorial; }//end of calculateFactorial method*/
}//end of class
public class Factorial {
public static void main(String args[]){
int i,fact=1;
int number=5;//It is the number to calculate factorial
for(i=1;i<=number;i++){
fact=fact*i;
}
System.out.println("Factorial of "+number+" is: "+fact);
}
}
import java.util.Scanner;
public class FactorialProgram {
public static void main(String[] args) {
int number, factorial;
Scanner scan=new Scanner(System.in);
System.out.print("Enter a number to calculate it's factorial : ");
number=scan.nextInt();
factorial=fact(number); //calling method fact()
System.out.println("Factorial of "+number+" is: "+factorial);
}
static int fact(int n) { //method which calculates factorial of a number using recursion
int output;
if(n==1){ return 1; } //termination condition of recursion method, i.e., when to stop calling a method
output = fact(n-1)* n; //calling same method again and again with new arguments (i.e., decremented value), until it reaches to termination condition
return output; //returning final value of output, when execution comes out from recursion method call stack/frame, i.e., when recursion stops
}
}
import java.util.Scanner;
class factorial {
public static void main(String args[]){
int i,n,fact=1;
System.out.println("Enter a number");
Scanner in = new Scanner(System.in);
n=in.nextInt();
for(i=1;i<=n;i++){
fact=fact*i;
}
System.out.println("Factorial of "+n+" is: "+fact);
}
}
import java.util.Scanner;
public class FactorialExample {
public static void main(String[] args) {
//create scanner object to input data
Scanner scanner = new Scanner(System.in);
System.out.println("Enter the number for finding factorial: ");
int num = scanner.nextInt();
int factorial = 1;
for (int i=1;i<=num;i++) {
factorial = factorial*i;
}
System.out.println("Factorial of "+num+" is :"+factorial);
}
}
import java.util.Scanner;
Tomy is a contributor at AskMeCode. We are committed to providing well-researched, accurate, and valuable content to our readers.
You May Also Like
Develop your next great product using Google's new flagship library for 3D graphics, Metal. We've created a series of tutorials for the rest of us! For example
3D graphics is not just for games. It's also used in architecture, aerospace, and it's growing in popularity as a...
Optimizing Your Morning Routine
Our morning routines are often the same. Some of us wake up, pick an outfit for the day, grab a...
Finding the Most Suitable Code to Write in
A software engineer is always finding the most suitable code to write in. The task is not easy, especially for...
The Information Technology Initiative is an initiative to archive your data forever in cyberspace; this initiative is the brainchild of South Asian Network Inc.
The Information Technology Initiative is an initiative to archive your data forever in cyberspace; this initiative is the brainchild of...
