Example: Perfect Number Checker (Brute-Force) in Java

// Perfect Number Checker (Brute-Force)
import java.util.Scanner;

// Main class containing the entry point of the program
public class Main {
    public static void main(String[] args) {
        // Step 1: Create a Scanner object to read user input
        Scanner scanner = new Scanner(System.in);

        // Step 2: Prompt the user to enter a number
        System.out.print("Enter a positive integer: ");
        int number = scanner.nextInt();

        // Step 3: Initialize sum of divisors
        int sumOfDivisors = 0;

        // Step 4: Check if the number is positive
        if (number <= 0) {
            System.out.println("Please enter a positive integer.");
        } else {
            // Step 5: Iterate from 1 up to (number - 1) to find proper divisors
            for (int i = 1; i < number; i++) {
                if (number % i == 0) { // If 'i' is a divisor
                    sumOfDivisors += i; // Add 'i' to the sum
                }
            }

            // Step 6: Compare the sum of divisors with the original number
            if (sumOfDivisors == number) {
                System.out.println(number + " is a perfect number.");
            } else {
                System.out.println(number + " is not a perfect number.");
            }
        }

        // Step 7: Close the scanner
        scanner.close();
    }
}