Java Programs
INPUT: 8326962 8+3+2+6+9+6+2=36 3+6=9
OUTPUT: 9
package programs;
import java.util.Scanner;
public class AdditivePersistence
{
public static void main(String argd[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter number");
int n=sc.nextInt();
int rem,sum=0,r,add=0;
while(n!=0)
{
rem=n%10;
sum=sum+rem;
n=n/10;
}
while(sum>0)
{
r=sum%10;
add=add+r;
sum=sum/10;
}
System.out.println(add);
}
}
Armstrong Number
INPUT: 153
OUTPUT: It is an armstrong
INPUT: 141
OUTPUT: It is not an armstrong
package programs;
import java.util.Scanner;
public class Armstrong
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter the number");
int n=sc.nextInt();
int rem,cube,sum=0;
int temp=n;
while(n!=0)
{
rem=n%10;
cube=rem*rem*rem;
sum=sum+cube;
n=n/10;
}
n=temp;
if(n==sum)
System.out.println("It is an armstrong");
else
System.out.println("It is not an armstrong");
}
}
Ascending order
Enter the number
5
Enter the array elements
23
45
12
14
1
Ascending order
1 12 14 23 45
package programs;
import java.util.Scanner;
public class Ascending
{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
int i,j,temp;
System.out.println("Enter the number");
int n=sc.nextInt();
int[] a=new int[n];
System.out.println("Enter the array elements");
for(i=0;i<n;i++)
{
a[i] = sc.nextInt();
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
System.out.println("Ascending order");
for(i=0;i<n;i++) {
System.out.print(" "+a[i]);
}
}
}
Descending order
Enter the number
5
Enter the array elements
12
6
2
3
45
Descending order
45 12 6 3 2
package programs;
import java.util.Scanner;
public class Descending
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
int i,j,temp;
System.out.println("Enter the number");
int n=sc.nextInt();
int[] a=new int[n];
System.out.println("Enter the array elements");
for(i=0;i<n;i++)
{
a[i] = sc.nextInt();
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]<a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
System.out.println("Descending order");
for(i=0;i<n;i++)
{
System.out.print(" "+a[i]);
}
}
}
Consonants, vowels, numbers and spaces
INPUT: HeLLo Ardous Geek2020
OUTPUT:
vowels 6
consonants 9
numbers 4
spaces 2
package programs;
import java.util.Scanner;
public class CononantsVowelsChar
{
public static void main(String args[])
{
int vowels=0,digits=0,consonants=0,space=0;
String s ="HeLLo Ardous Geek2020";
char[] ch=s.toCharArray();
for(int i=0;i<ch.length;i++)
{
if(ch[i]=='a' || ch[i]=='e'||ch[i]=='i'||ch[i]=='o'||ch[i]=='u')
{
vowels++;
}
else if(ch[i]>='0' && ch[i]<='9')
{
digits++;
}
else if(ch[i]==' ')
{
space++;
}
else
{
consonants++;
}
}
System.out.println("vowels "+vowels);
System.out.println("consonants "+consonants);
System.out.println("numbers "+digits);
System.out.println("spaces "+space);
}
}
Count characters
Enter string
Ardous Geek
A 1
D 1
E 2
G 1
K 1
O 1
R 1
S 1
U 1
package programs;
import java.util.Scanner;
public class CountCharacter
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter string");
String str = sc.nextLine();
int a[] = new int[26];
for(int i=0;i<str.length();i++)
{
if(str.charAt(i)>='A' && str.charAt(i)<='Z')
{
a[str.charAt(i)-'A']++;
}
else if(str.charAt(i)>='a' && str.charAt(i)<='z')
{
a[str.charAt(i)-'a']++;
}
}
for(int i=0;i<26;i++)
{
if(a[i]>0)
{
System.out.println((char)(i+'A')+" "+a[i]);
}
}
}
}