Question

Concepts tested by the program:

• Working with one dimensional parallel arrays
• Use of functions
• Use of loops and conditional statements

Description

The Lo Shu Magic Square is a grid with 3 rows and 3 columns shown below.

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.
  

s is shown below:

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.

See the sample outputs for more clarification.

Specifications

Input for this project:

• Vales of the grid (row by row)

Output for this project:

• Whether or not the grid is magic square
• Programmer’s full name
• Project number
• Project due date

Requirements

Use the following template to start your project:

#include<iostream>

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

bool isMagicSquare(int arrayRow1[], int arrayRow2[], int arrayRow3[], int size);

bool checkRange(int arrayRow1[], int arrayRow2[], int arrayRow3[], int size, int min, int max);

bool checkUnique(int arrayRow1[], int arrayRow2[], int arrayRow3[], int size);

bool checkRowSum(int arrayrow1[], int arrayrow2[], int arrayrow3[], int size);

bool checkColSum(int arrayrow1[], int arrayrow2[], int arrayrow3[], int size);

bool checkDiagSum(int arrayrow1[], int arrayrow2[], int arrayrow3[], int size);

void fillArray(int arrayRow1[], int arrayRow2[], int arrayRow3[], int size);

void showArray(int arrayrow1[], int arrayrow2[], int arrayrow3[], int size);

int main()

{

  

     /* Define a Lo Shu Magic Square using 3 parallel arrays corresponding to each row of the grid */

int magicArrayRow1[COLS], magicArrayRow2[COLS],

    magicArrayRow3[COLS];

// Your code goes here

      return 0;

}

// Function definitions go here

Create and use following functions:

• void fillArray(int arrayrow1[], int arrayrow2[], int arrayrow3[], int size) - Accepts 3 int arrays and a size as arguments, and fills the arrays out with values entered by the user. First argument corresponds to the first row of the magic square, second argument to the second row and the third argument to the third row of the magic square
• void showArray(int arrayRow1[], int arrayRow2[], int arrayRow3[], int size) - accepts 3 int arrays and a size as arguments and displays their content.

Example:    

1 3 5    (arrayRow1)

6 7 9    (arrayRow2)

8 2 4    (arrayRow3)

• bool isMagicSquare(int arrayRow1[], int arrayRow2[], int arrayRow3[], int size) - accepts 3 int arrays and a size as arguments and returns true if all the requirements of a magic square are met. Otherwise, it returns false. First argument corresponds to the first row of the magic square, second argument to the second row and the third argument to the third row of the magic square.
  
• bool checkRange(int arrayRow1[], int arrayRow2[], int arrayRow3[], int size, int min, int max) - accepts 3 int arrays, a size and a min and max value as arguments and returns true if the values in the arrays are within the specified range min and max. Otherwise, it returns false. First argument corresponds to the first row of the magic square, second argument to the second row and the third argument to the third row of the magic square.
  
• bool checkUnique(int arrayRow1[], int arrayRow2[], int arrayRow3[], int size) - accepts 3 int arrays and a size as arguments, and returns true if the values in the arrays are unique (only one occurrence of numbers between 1-9). Otherwise, it returns false. First argument corresponds to the first row of the magic square, second argument to the second row and the third argument to the third row of the magic square.
  
• bool checkRowSum(int arrayRow1[], int arrayRow2[], int arrayRow3[], int size) - accepts 3 int arrays and a size as arguments and returns true if the sum of the values in each of the rows are equal. Otherwise, it returns false. First argument corresponds to the first row of the magic square, second argument to the second row and the third argument to the third row of the magic square.
• bool checkColSum(int arrayRow1[], int arrayRow2[], int arrayRow3[], int size) - accepts 3 int arrays and a size as arguments and returns true if the sum of the values in each of the columns are equal. Otherwise, it returns false. First argument corresponds to the first row of the magic square, second argument to the second row and the third argument to the third row of the magic square.
  
• bool checkDiagSum(int arrayrow1[], int arrayrow2[], int arrayrow3[], int size) - accepts 3 int arrays and a size as arguments and returns true if the sum of the values in each of the array's diagonals are equal. Otherwise, it returns false. First argument corresponds to the first row of the magic square, second argument to the second row and the third argument to the third row of the magic square.
  It Numotmiwel int ToDayAbsentint number double Average Abonnifint NumberOfEmployers in Total Number O senta) START FROGRAM DECLAREN ME NFC ARF intiid A T INO DECLARF AHIHNumb Oft - TalumOAIA Numbol mp4) In h CITAR P UTA is heart ಗಳು TEP CUTPUT "FASenfter the name of employees is the company open OUTPUT Retum AverageNumberObcents SET H OEmpiens kuni mwa I number نادر شاهد | اید - Tube number 1 Tetit OUTPUT 'Please enter an play 10" w hereToront T The number of employees in the company must than 1" NPUIT id QUIVI ARCE, JHEOD TE WIMIN OUTPUT # in the number of emples in the company OUTPUT "Please enter the number of days this employee was abant INPUT Programme Name INPUI number NPUTH OUTPUT Programmet.me Alumni doethe OUTPUT LKD PROGRAN OUTPUT 'The number of day not be negative." << endl write to file id number absents
  

Can you guys help me in a flowchart, If i got wrong, plz correct me. thank you so much.

Answer 1

import java.io.*;

class GFG

{

static void generateSquare(int n)

    {

        int[][] magicSquare = new int[n][n];

          

        // Initialize position for 1

        int i = n/2;

        int j = n-1;

   

        // One by one put all values in magic square

        for (int num=1; num <= n*n; )

        {

            if (i==-1 && j==n) //3rd condition

            {

                j = n-2;

                i = 0;

            }

            else

            {

                //1st condition helper if next number

                // goes to out of square's right side

                if (j == n)

                    j = 0;

                      

                //1st condition helper if next number is

                // goes to out of square's upper side

                if (i < 0)

                    i=n-1;

            }

              

            //2nd condition

            if (magicSquare[i][j] != 0)

            {

                j -= 2;

                i++;

                continue;

            }

            else

                //set number

                magicSquare[i][j] = num++;

                  

            //1st condition

            j++; i--;

        }

   

        // print magic square

        System.out.println("The Magic Square for "+n+":");

        System.out.println("Sum of each row or column "+n*(n*n+1)/2+":");

        for(i=0; i<n; i++)

        {

            for(j=0; j<n; j++)

                System.out.print(magicSquare[i][j]+" ");

            System.out.println();

        }

    }

      

    // driver program

    public static void main (String[] args)

    {

        // Works only when n is odd

        int n = 7;

        generateSquare(n);

    }

}