Factorial


This is a program to find the factorial of a number

import java.io.*;
class factorial
{
long fact(int n)
{
long f=1;
for(int i=1;i<=n;i++)
f=f*i;
return f;
}
public void main()throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter the value of m and n");
int m=Integer.parseInt(br.readLine());
int n=Integer.parseInt(br.readLine());
long S=(fact(n)/fact(m))*fact(n-m);
System.out.println("The value of S is "+S);
}}

Comments

  1. Unknown30 July 2017 at 09:58

    import java.io.*;
    class factorial
    {
    public static void main(String args[])throws IOException
    {
    InputStreamReader isr=new InputStreamReader(System.in);
    BufferedReader br=-new BufferedReader(isr);

    System.out.println("Enter a number");
    double n,fact=1;//fact=1 because if we take fact=0 then anything multiply by zero will be zero so we had assumed fact=1
    n=Douuble.parseDouble(br.readLine);

    while(n>=1)
    {
    fact=fact*n;// dry run---STP1:::[fact= 1*5=5 .....5--=4].....STP2:::[fact=5*4=20...4--=3]...STP3:::[fact=20*3=60...3--=2]....STP4:::[fact=60*2=120...2--=1]....STP5::[fact=120*1=120 ....1--=0]
    n--;
    System.out.println("The factorial of the number is :="+fact);
    }
    }
    }


    CHECK THIS PROGRAM IF RIGHT OR WRONG PLS REPLY.

    ReplyDelete
  2. Unknown30 July 2017 at 10:00

    Check only he logic

    ReplyDelete

Post a Comment

Popular posts from this blog

Automorphic number

/* Write a program to check whether an entered number is an automorphic number or not.  * A number is said to be an automorphic number if it is present in the last digits of its square  */ import java.io.*; class automorphic { public static void main()throws IOException { BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); int m,b,p; double r=0; System.out.println("Enter a number"); int n=Integer.parseInt(br.readLine()); m=n; p=m*m; int c=0; do { c++; m=m/10; }while(m!=0); int q= p%(int)Math.pow(10,c); if(n==q) System.out.println(n+" is an Automorphic number"); else System.out.println(n+" is not an Automorphic number"); }}
Read more

Selection sort

/*  *Write a program to implement selection sort on a list of names and numbers according to user's choice  */ import java.io.*; class sel_sort { public void main()throws IOException { BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); System.out.println("Enter your choice \n 1.Sorting names \n 2.Sorting numbers"); int ch=Integer.parseInt(br.readLine()); switch(ch) { case 1:System.out.print("Enter number of names:"); int n=Integer.parseInt(br.readLine()); String s[]=new String[n]; System.out.println("Enter names"); for(int i=0;i<n;i++) s[i]=br.readLine(); int p; String min,temp; for(int i=0;i<n;i++) { min=s[i]; p=i; for(int j=i+1;j<n;j++) { if(s[j].compareTo(min)<0) { min=s[j]; p=j; } } temp=s[i]; s[i]=s[p]; s[p]=temp; } System.out.println("Sorted array"); for(int i=0;i<n;i++) System.out.println(s[i]+" "); break; case 2:System.out.print("Enter number...
Read more

Prime number

This is a Java program to check whether a given number is prime or not. A prime number is a non-negative integer which is divisible only by 1 and itself. For example, Five being divisible by only one and five, is a prime number. Six, on the other hand is divisible by one, two, three and six and hence is not a prime number. PROGRAM CODE import java.io.*; class prime { public void main()throws IOException { BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); System.out.println("Enter a number"); int a=Integer.parseInt(br.readLine()); int flag=0;   for(int i=2;i<=a/2;i++)                                               { if (a%i==0) { flag=1; break;}} if(flag==0) System.out.println("PRIME"); else System.out.println("NOT PRIME"); }}
Read more