Question

The Lo Shu Magic Square is a grid with 3 rows and 3 columns shown below. 35 The Lo Shu Magic Square has the following properties: The grid contains the numbers 1 - 9 exactly The sum of each row, each column and each diagonal all add up to the same number. This is shown below: 15 4 92 15 - 81 + 15 15 15 Write a program that simulates a magic square using 3 one dimensional parallel arrays of integer type. Each one the arrays corresponds to a row of the magic square. The program asks the user to enter the values of the magic square row by row and informs the user if the grid is a magic square or not.

I need help as quick as possible, thanks beforehand. Please provide the test output

Answer 1

Note: Could you plz go through this code and let me know if u need any changes in this.Thank You
_________________

#include <iostream>
#include <iomanip>
#include <ctime>
#include <cstdlib>
using namespace std;
// Global constants
const int ROWS = 3; // The number of rows in the array
const int COLS = 3; // The number of columns in the array
const int MIN = 1; // The value of the smallest number
const int MAX = 9; // The value of the largest number
// Function prototypes
void showResult(int[][COLS]);
void showArray(int[][COLS]);
bool isMagicSquare(int[][COLS]);
bool checkRange(int[][COLS]);
bool checkUnique(int[][COLS]);
bool checkRowSum(int[][COLS]);
bool checkColSum(int[][COLS]);
bool checkDiagSum(int[][COLS]);
int main()
{
  
int magicArray[ROWS][COLS];
char ch;
  
while(true)
{
for(int i=0;i<ROWS;i++)
{
for(int j=0;j<COLS;j++)
{
cout<<"Enter the number for row "<<(i)<<" and column "<<(j)<<" :";
cin>>magicArray[i][j];
}
}
for(int i=0;i<ROWS;i++)
{
for(int j=0;j<COLS;j++)
{
cout<<magicArray[i][j]<<" ";
}
cout<<endl;
}
  
// Test the magic array and display the result.
showResult(magicArray);
cout<<"\n\nDo you want to try again :";
cin>>ch;

if(ch=='y'||ch=='Y')
{

   continue;

}else
{
break;
}   
   }

return 0;
}
// ********************************************************
// The showResult function accepts a two-dimensional int *
// array as an argument, tests to determine if it is a *
// Lo Shu Magic Square and displays the result. *
// ********************************************************
void showResult(int values[][COLS])
{
// Determine if the array is a Lo Shu Magic Square.
if (isMagicSquare(values)) {
// If so, display a message indicating that the
// array is a magic square.
cout << "This is a Lo Shu magic square.\n\n";
}
else {
// If not, display a message indicating that the
// array is not a magic square.
cout << "This is not a Lo Shu magic square.\n\n";
}
}
// ********************************************************
// The showArray function accepts a two-dimensional int *
// array as an argument and displays its contents. *
// ********************************************************
void showArray(int values[][COLS])
{
// Step through all the values in the array.
for (int row = 0; row < ROWS; row++) {
for (int col = 0; col < COLS; col++) {
// Display the values in this row.
cout << values[row][col] << " ";
}
// End the line, so we can display the next row.
cout << endl;
}
}
// ********************************************************
// The isMagicSquare function accepts a two-dimensional *
// int array as an argument, and returns true if the *
// array meets all the requirements of a magic square. *
// Otherwise, it returns false. *
// ********************************************************
bool isMagicSquare(int values[][COLS])
{
// Initialize the status to false.
bool status = false;
// Call the functions to check the array.
bool isInRange = checkRange(values);
bool isUnique = checkUnique(values);
bool isEqualRows = checkRowSum(values);
bool isEqualCols = checkColSum(values);
bool isEqualDiag = checkDiagSum(values);
// Determine if the array meets all the requirments.
if (isInRange && isUnique && isEqualRows && isEqualCols && isEqualDiag) {
// If so, set the status to true.
status = true;
}
// Return the status.
return status;
}
// ********************************************************
// The checkRange function accepts a two-dimensional int *
// array as an argument, and returns true if the values *
// are within the specified range. Otherwise, it returns *
// false. *
// ********************************************************
bool checkRange(int values[][COLS])
{
// Initialize status to true.
bool status = true;
// Step through all the values in the array.
for (int row = 0; row < ROWS; row++) {
for (int col = 0; col < COLS; col++) {
// Determine if the value is out of range.
if (values[row][col] < MIN || values[row][col] > MAX) {
// If so, set status to false.
status = false;
}
}
}
// Return the status.
return status;
}
// ********************************************************
// The checkUnique function accepts a two-dimensional int *
// array as an argument, and returns true if the values *
// in the array are unique. Otherwise, it returns false. *
// ********************************************************
bool checkUnique(int values[][COLS])
{
int count;
int num=1;
bool status=true;
for (int i = 0; i < ROWS; i++)
{
count = 0;
for (int j = 0; j < COLS; j++)
{
if (values[i][j] == num)
count++;
}
if (count > 1)
status=false;
num++;
}
// Return the status.
return status;
}
// ********************************************************
// The checkRowSum function accepts a two-dimensional *
// int array as an argument, and returns true if the sum *
// of the values in each of the array's rows are equal. *
// Otherwise, it returns false. *
// ********************************************************
bool checkRowSum(int values[][COLS])
{
// Initialize status to true.
bool status = true;
// Calculate the sum of the values in the first row.
int sumRowA = values[0][0] + values[0][1] + values[0][2];
// Calculate the sum of the values in the second row.
int sumRowB = values[1][0] + values[1][1] + values[1][2];
// Calculate the sum of the values in the third row.
int sumRowC = values[2][0] + values[2][1] + values[2][2];
// Determine if the sum of the columns is not equal.
if ((sumRowA != sumRowB) || (sumRowA != sumRowC) || (sumRowB != sumRowC)) {
// If so, set status to false.
status = false;
}
// Return the status.
return status;
}
// ********************************************************
// The checkColSum function accepts a two-dimensional *
// int array as an argument, and returns true if the sum *
// of the values in each of the array's columns are *
// equal. Otherwise, it returns false. *
// ********************************************************
bool checkColSum(int values[][COLS])
{
// Initialize status to true.
bool status = true;
// Calculate the sum of the values in the first column.
int sumColA = values[0][0] + values[1][0] + values[2][0];
// Calculate the sum of the values in the second column.
int sumColB = values[0][1] + values[1][1] + values[2][1];
// Calculate the sum of the values in the third column.
int sumColC = values[0][2] + values[1][2] + values[2][2];
// Determine if the sum of the columns is not equal.
if ((sumColA != sumColB) || (sumColA != sumColC) || (sumColB != sumColC)) {
// If so, set status to false.
status = false;
}
// Return the status.
return status;
}
// ********************************************************
// The checkDiagSum function accepts a two-dimensional *
// int array as an argument, and returns true if the sum *
// of the values in each of the array's diagonals are *
// equal. Otherwise, it returns false. *
// ********************************************************
bool checkDiagSum(int values[][COLS])
{
// Initialize status to true;
bool status = true;
// Calculate the sum of the values in the first diagonal.
int sumDiagA = values[0][0] + values[1][1] + values[2][2];
// Calculate the sum of the values in the second diagonal.
int sumDiagB = values[2][0] + values[1][1] + values[0][2];
// Determine if the sum of the diagonals is not equal.
if (sumDiagA != sumDiagB) {
// If so, set status to false.
status = false;
} // Return the status.
return status;
}
__________________________________

Output:

C:\Program Files (x86)\Dev-Cpp\MinGW64\bin\LoShuMagicSquareOtNot.exe Enter the number for row 0 and column 0 :1 Enter the number for row Enter the number for row 0 and column 2 :2 Enter the number for row Enter the number for row Enter the number for row and column 1 :3 and column 0 :5 and column 1 :4 and column 2 :9 Enter the number for row 2 and column 0 :6 Enter the number for row Enter the number for row 2 and column 2 :8 and column 1 :7 1 3 2 5 4 9 6 7 8 This is not a Lo Shu magic square. Do you want to try again :y Enter the number for row 0 and column 0 :10 Enter the number for row Enter the number for row 0 and column 2 :3 Enter the number for row Enter the number for row and column 1 :2 and column 0 :4 and column 1 :15 Enter the number for row and column 2 :6 Enter the number for row 2 and column 0 :7 Enter the number for row and column 1 :8 Enter the number for row 2 and column 2 :-8 10 2 3 4 15 6 7 8 -8 This is not a Lo Shu magic square.

Do you want to try again :y Enter the number for row 0 and column 0 :4 Enter the number for row 0 and column 1 :9 Enter the number for row 0 and column 2 :2 Enter the number for row 1 and column 0 :3 Enter the number for row 1 and column 1 :5 Enter the number for row 1 and column 2 :7 Enter the number for row 2 and column 0 :8 Enter the number for row 2 and column 1 :1 Enter the number for row 2 and column 2 :6 4 9 2 3 5 7 8 1 6 This is a Lo Shu magic square. Do you want to try again :n Process exited after 54.71 seconds with return value 0 Press any key to continue .

_______________Could you plz rate me well.Thank You