Character triangle pyramid program in Java

import java.util.Scanner;
public class CharacterTrianglePyramid {
 public static void main(String[] args) 
 {
  char ch;
  int sp;
  Scanner sc = new Scanner(System.in);
  System.out.print("Enter last character of triangle : ");
  ch = sc.next().charAt(0);
  if (ch >= 'a' && ch <= 'z') {
   ch = (char)(ch - 32);
  }
  System.out.println();
  for (char r = 'A'; r <= ch; ch--) {
   for (char c = ch; c >= r; c--) {
    System.out.print(c);
   }
   System.out.println();
  }
 }
}

Output:

Enter last character of triangle : e

EDCBA
DCBA
CBA
BA
A

BUILD SUCCESSFUL (total time: 5 seconds)

Note: Hello friends, If you have any better solution for this programs then please comment below, I will add your comment as a solution for this programs.

Thanks for visiting my blog.

Number rectangle structure program in Java

import java.util.Scanner;
public class NumberRectangle
{
 public static void main(String[] args) 
 {
  int num, r = 1;
  System.out.print("Enter loop repeat number(rows): ");
  Scanner sc = new Scanner(System.in);
  num = sc.nextInt();
  System.out.println();
  for (; num >= 1; num--, r++) {
   for (int c = 1; c <= num; c++) {
    System.out.print(c);
   }
   for (int sp = r; sp > 1; sp--) {
    System.out.print("__");
   }
   for (int c = num; c >= 1; c--) {
    System.out.print(c);
   }
   System.out.println();
  }
 }
}

Output:

Enter loop repeat number(rows): 6

123456654321
12345__54321
1234____4321
123______321
12________21
1__________1

BUILD SUCCESSFUL (total time: 5 seconds)

Note: Hello friends, If you have any better solution for this programs then please comment below, I will add your comment as a solution for this programs.

Thanks for visiting my Blog.

Number triangle pyramid program in Java

import java.util.Scanner;
public class NumberTriangle
{
 public static void main(String[] args) 
 {
  int num;
  System.out.print("Enter loop repeat number(rows): ");
  Scanner sc = new Scanner(System.in);
  num = sc.nextInt();
  for (int r = 1; r <= num; r++) {
   for (int sp = 1; sp <= num - r; sp++) {
    System.out.print("  ");                         //it is 2 blank space
   }
   for (int c = 1; c <= 2 * r - 1; c++) {
    System.out.print(" " + c);
   }
   System.out.println();
  }
 }
}

Output:

Enter loop repeat number(rows): 5

         1
       1 2 3
     1 2 3 4 5
   1 2 3 4 5 6 7
 1 2 3 4 5 6 7 8 9


BUILD SUCCESSFUL (total time: 4 seconds)

Note: Hello friends, If you have any better solution for this programs then please comment below, I will add your comment as a solution for this programs.

Thanks for visiting my Blog.

Number triangle pyramid program in Java.

import java.util.Scanner;
public class NumberTraingle
{
 public static void main(String[] args) 
 {
  int num;
  System.out.print("Enter number of rows : ");
  Scanner sc = new Scanner(System.in);
  num = sc.nextInt();
  for (int r = 1; r <= num; r++) {
   for (int sp = num - r; sp > 0; sp--) {
    System.out.print(" ");
   }
   for (int c = 1; c <= r; c++) {
    System.out.print(r);
   }
   for (int k = 2; k <= r; k++) {
    System.out.print(r);
   }
   System.out.println();
  }
 }
}

Output:

Enter loop repeat number(rows): 5

         1
       1 2 3
     1 2 3 4 5
   1 2 3 4 5 6 7
 1 2 3 4 5 6 7 8 9

BUILD SUCCESSFUL (total time: 3 seconds)

Note: Hello friends, If you have any better solution for this programs then please comment below, I will add your comment as a solution for this programs.

Thanks for visiting my Blog.

Empty triangle pyramid program in Java.

package demo;
import java.util.Scanner;
public class BlankPyramid
{
 public static void main(String[] args) 
 {
  Scanner sc = new Scanner(System.in);
  int num;
  System.out.print("Enter no of rows: ");
  num = sc.nextInt();
  System.out.println("*");
  for (int r = 1; r <= num; r++) 
  {
   System.out.print("*");
   for (int sp = 1; sp < r; sp++) 
   {
    System.out.print(" ");
   }
   System.out.println("*");
  }
  for (int j = 1; j <= num + 2; j++) 
  {
   System.out.print("*");
  }
 }
}

Output:
Enter no of rows: 4

*
**
* *
*  *
*   *

******

BUILD SUCCESSFUL (total time: 3 seconds)

Note: Hello friends, If you have any better solution for this programs then please comment below, I will add your comment as a solution for this programs.

Thanks for visiting my Blog.

Star triangle frame pyramid program in Java.

package demo;
import java.util.Scanner;
public class TriangleFrame
{
 public static void main(String[] args) 
 {
  int num, n;
  Scanner sc = new Scanner(System.in);
  System.out.print("Enter number of rows: ");
  num = sc.nextInt();
  System.out.println();
  n = num;
  for (int r = 1; r <= num; r++) 
  {
   for (int sp = 1; sp <= r; sp++) {
    System.out.print(" ");
   }
   for (int c = 1; c <= n; c++) {
    System.out.print("*");
   }
   for (int c = num - r; c >= 1; c--) {
    System.out.print("*");
   }
   n--;
   System.out.println();
  }
  for (int r = 2; r <= num; r++) {
   for (int sp = num - r + 1; sp >= 1; sp--) {
    System.out.print(" ");
   }
   for (int c = 1; c <= r; c++) {
    System.out.print("*");
   }
   for (int c = r - 1; c >= 1; c--) {
    System.out.print("*");
   }
   System.out.println();
  }
 }
}

Output:

Enter number of rows: 4

 *******
  *****
   ***
    *
   ***
  *****
 *******

BUILD SUCCESSFUL (total time: 5 seconds)

Note: Hello friends, If you have any better solution for this programs then please comment below, I will add your comment as a solution for this programs.

Thanks for visiting my Blog.

Reverse Number triangle pyramid program in Java.

package demo;
import java.util.Scanner;
public class ReverseNumberTriangle
{
 public static void main(String[] args) 
 {
  int num;
  Scanner sc = new Scanner(System.in);
  System.out.print("Enter any number : ");
  num = sc.nextInt();
  for (int r = 1; r <= num; r++) 
  {
   for (int sp = 1; sp < r; sp++) 
   {
    System.out.print(" ");
   }
   for (int c = r; c <= num; c++) 
   {
    System.out.print(c + " ");
   }
   System.out.println();
  }
 }
}

Output:

Enter any number : 6

1 2 3 4 5 6 
 2 3 4 5 6 
  3 4 5 6 
   4 5 6 
    5 6 
     6 

BUILD SUCCESSFUL (total time: 4 seconds)

Reverse star pyramid program in Java

package demo;
import java.util.Scanner;
public class ReverseStar
{
 public static void main(String[] args) 
 {
  int num, r = 1;
  Scanner sc = new Scanner(System.in);
  System.out.print("Enter loop repeat number(rows): ");
  num = sc.nextInt();
  System.out.println();
  for (; num >= 1; num--, r++) 
  {
   for (int c = 1; c <= num; c++) {
    System.out.print("*");
   }
   for (int sp = r; sp > 1; sp--) {
    System.out.print(" ");
   }
   for (int sp = r; sp > 1; sp--) {
    System.out.print(" ");
   }
   for (int c = num; c >= 1; c--) {
    System.out.print("*");
   }
   System.out.println();
  }
 }
}

Output:

Enter loop repeat number(rows): 7

**************
******  ******
*****    *****
****      ****
***        ***
**          **
*            *


BUILD SUCCESSFUL (total time: 3 seconds)

Java program to print perfect numbers from 1 to 1000

Perfect Number:  a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself.

package demo;
public class PerfectNumbers
{
 public static void main(String[] args) 
 {
  int i, sum;
  System.out.print("Perfect numbers are: ");
  for (int n = 1; n <= 1000; n++) 
  {
   i = 1;
   sum = 0;
   while (i < n) {
    if (n % i == 0) {
     sum = sum + i;
    }
    i++;
   }
   if (sum == n) {
    System.out.print(n + " ");
   }
  }
 }
}

Output: Java program to print perfect numbers from 1 to 1000

Perfect numbers are: 6 28 496 
BUILD SUCCESSFUL (total time: 2 seconds)

Java program to find perfect numbers

Perfect Number:  a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself.

package demo;
import java.util.Scanner;
public class PerfectNumber
{
 public static void main(String[] args) 
 {
  Scanner sc = new Scanner(System.in);
  int n, i = 1, sum = 0;
  System.out.print("Enter a number: ");
  n = sc.nextInt();
  while (i < n) {
   if (n % i == 0) {
    sum = sum + i;
   }
   i++;
  }
  if (sum == n) {
   System.out.print(i + " is a perfect number");
  } else {
   System.out.print(i + " is not a perfect number");
  }
 }
}

Output: Java program to find perfect numbers

Enter a number: 6
6 is a perfect number
BUILD SUCCESSFUL (total time: 36 seconds)

Java program to print alternative number-star pyramid.

package demo;
import java.util.Scanner;
public class NumberWithStar
{
 public static void main(String[] args) 
 {
  int num, z = 1, p, n;
  Scanner sc = new Scanner(System.in);
  System.out.print("Enter maximum number : ");
  //Input 5 for desire output
  num = sc.nextInt();
  for (int r = 1; r <= num; r++, z = z + 2) 
  {
   for (int c = 1; c <= z; c++) 
   {
    if (c % 2 == 0) {
     System.out.print("*");
    } else {
     System.out.print(r);
    }
   }
   System.out.println();
  }
  n = num + 3;
  p = num - 1;
  for (int r = num; r >= 1; r--, n = n - 2, p--) 
  {
   for (int c = 1; c <= n; c++) 
   {
    if (c % 2 == 0) {
     System.out.print("*");
    } else {
     System.out.print(p);
    }
   }
   System.out.println();
  }
 }
}

Output:

Enter maximum number : 5

1
2*2
3*3*3
4*4*4*4
5*5*5*5*5
4*4*4*4*
3*3*3*
2*2*
1*


BUILD SUCCESSFUL (total time: 5 seconds)

Nested Star Hash Pyramid Program in Java

package demo;
public class NestedStrarPyramid
{
 public static void main(String[] args) 
 {
  int n = 5;
  for (int r = 1; r <= 6; r++, n--) {
   /*first pyramid*/
   for (int c = 1; c <= n; c++) {
    System.out.print(" #");
   }
   /*second pyramid*/
   for (int c = 1; c <= r; c++) {
    if (c == 1) {
     System.out.print(" *");
    } else {
     System.out.print(" #");
    }
   }
   /*third pyramid*/
   for (int c = r; c > 1; c--) {
    if (c == 2) {
     System.out.print(" *");
    } else {
     System.out.print(" #");
    }
   }
   /*fourth pyramid*/
   for (int c = n; c >= 1; c--) {
    System.out.print(" #");
   }
   System.out.println();
  }
 }
}

Output:

run:

 # # # # # * # # # # #
 # # # # * # * # # # #
 # # # * # # # * # # #
 # # * # # # # # * # #
 # * # # # # # # # * #
 * # # # # # # # # # *


BUILD SUCCESSFUL (total time: 1 second)

Half Square Number Triangle in Java

package demo;
import java.util.Scanner;
public class NumberTriangle
{
 public static void main(String[] args) 
 {
  int num;
  Scanner sc = new Scanner(System.in);
  System.out.print("Enter any number : ");
  num = sc.nextInt();
  for (int r = 1, n = num; r <= num; r++, n--) 
  {
   for (int sp = r; sp > 1; sp--) {
    System.out.print(" ");
   }
   for (int c = r, p = n; c <= num; c++, p--) 
   {
    System.out.print(p);
   }
   for (int c = num - r, p = 2; c >= 1; c--, p++) 
   {
    System.out.print(p);
   }
   System.out.println();
  }
 }
}

Output:

Enter any number : 5

543212345
 4321234
  32123
   212
    1


BUILD SUCCESSFUL (total time: 7 seconds)

Number Triangle Pattern Java Program.

package demo;
import java.util.Scanner;
public class NumberTriangle
{
 public static void main(String[] args) 
 {
  int num;
  Scanner sc = new Scanner(System.in);
  System.out.print("Enter maximum number : ");
  num = sc.nextInt();
  for (int r = 1, m = 0; r <= num + 1; r++, m++) 
  {
   for (int c = 1, n = m; c <= r; c++, n--) 
   {
    System.out.print(n);
   }
   for (int c = 1; c < r; c++) 
   {
    System.out.print(c);
   }
   System.out.println();
  }
 }
}

Output:

run:
Enter maximum number : 5

0
101
21012
3210123
432101234
54321012345


BUILD SUCCESSFUL (total time: 3 seconds)

Number Rhombus Pattern Program in Java

package demo;
import java.util.Scanner;
public class NumberPattern
{
 public static void main(String[] args) 
 {
  int num, c;
  Scanner sc = new Scanner(System.in);
  System.out.print("Enter maximum number : ");
  num = sc.nextInt();
  for (int r = 1; r <= num; r++) {
   for (int sp = num - r; sp >= 1; sp--) {
    System.out.print(" ");
   }
   System.out.print(r);
   for (int sp = r * 2; sp > 1; sp--) {
    System.out.print(" ");
   }
   System.out.print(r);
   System.out.println();
  }
  for (int r = 1, n = num - 1; r < num; r++, n--) {
   for (int sp = r; sp >= 1; sp--) {
    System.out.print(" ");
   }
   System.out.print(n);
   for (int sp = n * 2; sp > 1; sp--) {
    System.out.print(" ");
   }
   System.out.print(n);
   System.out.println();
  }
 }
}

Output:

Enter maximum number : 5

    1 1
   2   2
  3     3
 4       4
5         5
 4       4
  3     3
   2   2
    1 1


BUILD SUCCESSFUL (total time: 3 seconds)