Author

Author- Ram Ranjeet Kumar
Showing posts with label Java. Show all posts
Showing posts with label Java. Show all posts

Monday, March 9, 2020

Dispaly the sum of all perfect number within 1 to 1000 in java

class PerfectSum
{
    public static void main(String[] args)
    {
        int i, j, end, sum,sum1=0;

   
    System.out.println("Sum Of All Perfect numbers between 1 to 1000\n");
    
    for(i=1; i<=1000; i++)
    {
        sum = 0;

       for(j=1; j<i; j++)
        {
            if(i % j == 0)
            {
                sum += j;
            }
        }
      
        if(sum == i)
        {
            System.out.println(" "+i);
            sum1=sum1+i;
        }
    }
    System.out.print(" Sum Of All Perfect No. is: "+sum1);
    }
}


Display all three(3) Digit Pallindrome Number in java

class  PalindromeNo
{
   
    public static void main(String[] args)
    {
        int num, rem, rev, temp;
        System.out.println(" \n3 Digit Palindrome numbers: \n");
        for(num=100;num<=1000;num++)
            {
                temp=num;
                rev=0;
                while(temp>0)
                    {
                        rem=temp%10;
                        temp=temp/10;
                        rev=rev*10+rem;
                    }
                if(num==rev)
                    System.out.print(" "+num);
            }
    }
}

Display all Disarium Number Between 1 to 100000 in java

class  DisariumNo
{
    static int calculateLength(int n)
            {
            int length = 0;
            while(n != 0)
                {
                length = length + 1;
                n = n/10;
                }
            return length;
            }
           
 static int pow(int n,int p)
    {
         int pw=1;
         while(p>0)
        {
             pw=pw*n;
             p--;
         }
             return pw;
         }

static int sumOfDigits(int num)
         {
         int sum = 0, rem = 0;
         int len = calculateLength(num);
       
         while(num > 0)
             {
                 rem = num%10;
                 sum = sum + pow(rem,len);
                 num = num/10;
                 len--;
             }
            return sum;
         }  
       
  public static void main(String[] args)
    {  
    int result = 0;    
    System.out.println("Disarium numbers between 1 and 100000 are\n");   
    for(int i = 1; i <= 100000; i++)
        {
            result = sumOfDigits(i);
            if(result == i)   
            System.out.print(", " +i);
        } 
    }
}


Display how many Armstrong Number Between 1 to 1000 in Java

class ArmstrongNo
{
    public static void main(String[] args)
    {
    int n, temp, d1, d2, d3;   
    System.out.println("Print all Armstrong numbers between 1 and 1000:\n");
    n = 001;
    while (n <= 900)
    {
        d1 = n - ((n / 10) * 10);
        d2 = (n / 10) - ((n / 100) * 10);
        d3 = (n / 100) - ((n / 1000) * 10);
        temp = (d1 * d1 * d1) + (d2 * d2 * d2) + (d3 * d3 * d3);
        if (temp == n)
        {
            System.out.println("\n Armstrong no is: " +temp);
        }
        n++;
    }
    }
}




Print all the prime number between 1 to 100 in java

class  PrimeNo
{
    public static void main(String[] args)
    {
        int i, n = 1, count;
        System.out.println("Prime Number Between 1 to 100");
        while(n <= 100)
            {
            count = 0;
            i = 2;
            while(i <= n/2)
                {
                if(n%i == 0)
                    {
                    count++;
                    break;
                    }
                i++;
                }
                if(count == 0 && n != 1 )
                {
                    System.out.println(" "+ n);
                }
            n++;
        }

    }
}


Friday, August 2, 2019

Program to Dual Case Single Statement In Java to Perform Calculation By accepting Small Or Big Alphabet





import java.util.*;
class Switch2
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
char ch;
int a,b,c;
System.out.println("\n\n\tInput Two Number.");
a=sc.nextInt();
b=sc.nextInt();

System.out.println("\n\n\tCalculation Program.");
System.out.println("\n\n\tPress A for Addition + .");
System.out.println("\n\n\tPress S for Subtraction -  .");
System.out.println("\n\n\tPress M for Multiplication *  .");
System.out.println("\n\n\tPress D for Division /  .");
System.out.print("\n\n\tMake Your Choice.===> ");

ch=sc.next().charAt(0); //There is No nextChar()  in Java
switch(Character.toUpperCase(ch)) // Convert Lower case To Upper Case

{
case 'A': //case 'a':
System.out.println("\n\n\tAddition Program.");
c=a+b;
System.out.println("\n\n\tSum= ."+c);
break;

case 'S': //case 's':
System.out.println("\n\n\tSubtraction Program.");
c=a-b;
System.out.println("\n\n\tSubtraction= ."+c);
break;

case 'M': //case 'm':
System.out.println("\n\n\tMultiplication Program.");
c=a*b;
System.out.println("\n\n\tMultiplication= ."+c);
break;

case 'D': //case 'd':
System.out.println("\n\n\tDivision Program.");
c=a/b;
System.out.println("\n\n\tDivision= ."+c);
break;

default:
System.out.println("\n\tWrong Entry");
break;

}

}

}

Tuesday, July 30, 2019

Switch Case Print Week days Program In Java

import java.util.*;
class Switch1
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
int ch;
System.out.println("\n\tEnter the Day Number 1 to 7");
ch=sc.nextInt();
switch(ch)
{
case 1:
System.out.println("\n\tMonday");
break;

case 2:
System.out.println("\n\tTuesday");
break;

case 3:
System.out.println("\n\tWednesday");
break;

case 4:
System.out.println("\n\tThrusday");
break;

case 5:
System.out.println("\n\tFriday");
break;

case 6:
System.out.println("\n\tSaturday");
break;

case 7:
System.out.println("\n\tSunday");
break;

default:
System.out.println("\n\tWrong Entry");
break;
}
}
}

Friday, July 26, 2019

Program to add two array in Java

import java.util.*;
class AddArray
{
public static void main(String[] args)
{
int array1[]=new int[100];
int array2[]= new int[100];
int array3[]=new int[100];
int i,j,n;
Scanner sc=new Scanner(System.in);
System.out.println("\n\t\tProgram To Add Two Array.!");
System.out.print("\n\t\tEnter the Default size Of two Array==> ");
n=sc.nextInt();
System.out.println("Enter the " +(n+1)+" element in first Array array1");
for(i=0;i<=n;i++)
{
System.out.print("\n\t\tarray1["+i+"]= ");
array1[i]=sc.nextInt();
}

System.out.println("Enter the " +(n+1)+" element in second Array array2");
for(i=0;i<=n;i++)
{
System.out.print("\n\t\tarray2["+i+"]= ");
array2[i]=sc.nextInt();
}
System.out.println("\n\t\tElements in Array1 .!");
for(i=0;i<=n;i++)
{
System.out.print("\n\t\tarray1["+i+"]= "+array1[i]);
}
System.out.println("\n\t\tElements in Array2 .!");
for(i=0;i<=n;i++)
{
System.out.print("\n\t\tarray2["+i+"]= "+array2[i]);
}
System.out.print("\n\t\tAddition Of Array1 and Array2");
for(i=0;i<=n;i++)
{
array3[i]=array1[i]+array2[i];
System.out.println("\n\n\t\tArray1["+i+"]+Array2["+i+"]==>("+array1[i]+"+"+array2[i]+")=Array3["+i+"]= "+array3[i]);
}
}
}
OUTPUT

Bubble Sort Using User Input in Java

import java.util.*;
class Array2
{
public static void main(String[] args)
{
int array1[]=new int[100];
int i,j,n;
Scanner sc=new Scanner(System.in);
System.out.print("\n\n\t\tEnter The Size Of Array===> ");
n=sc.nextInt();
System.out.println("\n\n\t\tEnter The "+n+" Element Of Array");
for(i=0;i<=n;i++)
{
array1[i]=sc.nextInt();
}
System.out.println("\n\n\t\tElements in Array Before Sorting===>");
for(i=0;i<=n;i++)
{
System.out.print("\n\t\tArray"+i+"="+array1[i]);
}
System.out.println("\n\n\t\tElements in Array After Sorting===>");
for(i=0;i<=n;i++)
{
for(j=i+1;j<=n;j++)
{
if(array1[i]>array1[j]){
int temp=array1[i];
array1[i]=array1[j];
array1[j]=temp;}
}
System.out.print("\n\t\tArray"+i+"="+array1[i]);
}

}
}

Thursday, July 25, 2019

Sort Array element in Java


class SortArray
{
public static void main(String[] args)
{
int[] a={5,2,8,0,1,33,45,22,11,99};
int i,j,temp;
System.out.println("\n\t\tArray Before Swapping===>  ");
for(i=0; i<=9;i++)
{
System.out.println("\n\t\ta"+i+ "="+a[i]);
}
System.out.println("\n\t\tArray After Swapping===>  ");
for(i=0;i<=9;i++)
{
for(j=i+1;j<=9;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
System.out.println("\n\t\ta"+i+ "="+a[i]);
}
}
}