N - Queens problem is to place n - queens in such a manner on an n x n chessboard that no queens attack each other by being in the same row, column or diagonal.
This C++ program is designed to find the maximum of three input numbers entered by the user.
Here's how the program works in summary:
The user is prompted to input three numbers.
The program then finds the maximum of these numbers using the FindMaxNum function and displays the result.