duplicate num

=========================
import java.util.*;
import java.util.Arrays;
public class duplicate_num{
public static void main(String[] args)
{
//int[] my_array = {1, 2, 5, 5, 6, 6, 7, 2};
Scanner s=new Scanner(System.in);
System.out.println("enter number of elements");
int n=s.nextInt();
int my_array[]=new int[n];
System.out.println("enter elements");
for(int i=0;i<n;i++)
{//for reading array
my_array[i]=s.nextInt();
}
for (int i = 0; i < my_array.length-1; i++)
{
for (int j = i+1; j < my_array.length; j++)
{
if ((my_array[i] == my_array[j]) && (i != j))
{
System.out.println("Duplicate Element : "+my_array[j]);
}
}
}
}
}
===========================
reverse number
============================
import java.util.*;
public class revnum
{
public static void main(String args[])
{
Scanner s=new Scanner(System.in);
System.out.print("Enter any number:");
int n, m, a = 0,x;
n = s.nextInt();
m = n;
while(n > 0)
{
x = n % 10;
a = a * 10 + x;
n = n / 10;
}
System.out.println("Reverse of input number is: "+a);
}
}
=============================
decimal to binary
============================
import java.io.*;
import java.util.Scanner;
class dectobin
{
static void dec_bin(int n)
 {
int bin[]=new int [1000];
int i=0,q=n;
while (n>0)
{
bin[i]=n%2;
n=n/2;
i++;
}
System.out.println("binary number of "+ q +" is");
for (int j = i - 1; j >= 0; j--)
System.out.print(bin[j]);
}
public static void main(String args[])
{
Scanner in=new Scanner(System.in);
System.out.println("enter an number:");
int n=in.nextInt();
dec_bin(n);
}
}
==========================
perfect square
==========================
import java.util.*;
import java.util.Scanner;
class perfsq{
static void isperf(int n)
{
double res;
res=Math.sqrt(n);
if(res-Math.floor(res)==0)
{
System.out.println("given number is a perfect square");
}
else
System.out.println("given number is not a perfect square");
}
public static void main(String args[])
{
int n;
Scanner in=new Scanner(System.in);
System.out.println("enter a number");
n=in.nextInt();
isperf(n);
}
}
============================
factorial
==============================
import java.io.*;
import java.util.*;
import java.util.Scanner;
class fact
{
public static void main(String args[])
{
Scanner s = new Scanner(System.in);
System.out.println("enter a number:");
 int n,res=1,i;
n=s.nextInt();
for(i=1;i<=n;i++)
{
res= res*i;
}
System.out.println(+res);
}
}
==============================
bubble sort
==============================
{
public static void main(String args[])
{
Scanner in=new Scanner(System.in);
int n,i,j,temp;
System.out.println("enter size of array");
n=in.nextInt();
int arr[]=new int[n];
System.out.println("enter elements of array");
for(i=0;i<n;i++)
{
arr[i]=in.nextInt();
}
for(i=0;i<n;i++)
{
for(j=1;j<n-i;j++)
{
if(arr[j-1]>arr[j])
{
temp=arr[j-1];
arr[j-1]=arr[j];
arr[j]=temp;
}
}
}
System.out.println("array after bubble sort is");
for(i=0;i<n;i++)
{
System.out.println(arr[i]);
}
}
}
=============================
armstorng
============================
import java.io.*;
import java.util.Scanner;
public class armstrong{

public static void main(String[] args) {

int low = 0, high = 999;

for(int i = low + 1; i < high; ++i) {

int digits = 0;
int result = 0;
int num = i;
 // i of digits calculation
while (num != 0) {
num /= 10;
++digits;
}

num = i;

// result contains sum of nth power of its digits

while (num != 0) {
int remainder = num % 10;
result += Math.pow(remainder, digits);
num /= 10;
}

if (result == i)
System.out.print(i + " ");
}
}
}
============================
sum of digits
=============================
import java.util.*;
import java.util.Scanner;
class sumofdig{
static void sum(int n)
{
int res=0,a=n;
while(n!=0)
{
res=res + n%10;
n=n/10;
}
System.out.println("sum of the digits of " +a+ " is "+res);
}
public static void main(String args[])
{
int n;
Scanner in=new Scanner(System.in);
System.out.println("enter a number");
n=in.nextInt();
sum(n);
}
}
==================================

***************************************************************************(EOF)***
***************************************************************************