help me solve this in c++ please Write a program that asks the user to enter a list of numbers from 1 to 9 in random order, creates and displays the corresponding 3 by 3 square, and determines whether the resulting square is a Lo Shu Magic Square.NotesCreate the square by filling the numbers entered from left to right, top to bottom.Input validation - Do not accept numbers outside the range. Do not accept repeats.Must use two-dimensional arrays in the implementation.Functional decomposition — Program should rely on functions that are consistent with the algorithm. Lo-Shu Magic SquareloShu.cppThe Lo Shu Magic Square is a grid with 3 rows and 3 columns as shown below:492357816The grid contains the numbers 1 through 9 exactly.The sum of each row, each column, and each diagonal all add up to the same number:15492 15357 158 16 151515 15 15 Input ValidationMicrosoft Visual Studio Debug ConsoleLo Shu Magic SquareCreating Lo Shu SquareEnter Nine Numbers (1-9)Number 1: 1Number 2: 2Number 3: 2Error ...2 is already in the Lo Shu Square. Try againNumber 3: 3Number 4: 4Number 5: 5Number 6: 10Error ... Invalid number. Try againNumber 6: 6Number 7: 7Number 8: 8Number 9: 9|| 1 | 2 | 3 || 4 | 5 | 6 || 7 | 8 | 9 |Sorry ... this is not a Lo Shu Magic SquareWould you like to try again (y/n)? n

Given: We have to write c++ code that asks the user to enter a list of numbers from 1 to 9 in random order, creates and displays the corresponding 3 by 3 square, and determines whether the resulting square is a Lo Shu Magic Square.C++ Code : #include <iostream> using namespace std; const int GRID_SIZE = 3; bool isLoShuSquare(const double[][GRID_SIZE]); double sum_Of_Row(const double[][GRID_SIZE]); double sum_Of_Column(const double[][GRID_SIZE]); double sum_Of_MainDiagonal(const double[][GRID_SIZE]); double sum_Of_BackDiagonal(const double[][GRID_SIZE]); int main() { double Arr[3][3]; cout<<"Creating Lo Shu Square ..."<<endl; cout<<endl; cout<<"Enter 9 Numbers (1-9)"<<endl; for(int i=0;i<3;i++) { for(int j=0;j<3;j++) { cout<<"\t Number "<<i*3+j+1<<": "; cin>>Arr[i][j]; } } for(int i=0;i<3;i++) { cout<<"*****"<<endl; for(int j=0;j<3;j++) { cout<<"| "<<Arr[i][j]<<" "; } cout<<"|"<<endl; } cout<<"*****"<<endl; cout << "arr is"; cout << (isLoShuSquare(Arr) ? " " : " NOT "); cout << "a Lo Shu Magic Square!" << endl; return 0; } double sum_Of_Row(const double Arr[][GRID_SIZE]) { double total; for(int row = 0; row < GRID_SIZE; row++) { total = 0; for(int column = 0; column < GRID_SIZE; column++) total += Arr[row][column]; // cout << "total for row " << (row + 1) << " = " << total << endl; } return total; } double sum_Of_Column(const double Arr[][GRID_SIZE]) { double total; for(int columns = 0; columns < GRID_SIZE; columns++) { total = 0; for (int row = 0; row < GRID_SIZE; row++) total += Arr[row][columns]; // cout << "total for columns " << (columns + 1) << " = " << total << endl; } return total; } double sum_Of_MainDiagonal(const double Arr[][GRID_SIZE]) { double total = 0; // [x][][] [0][0] // [][x][] [1][1] // [][][x] [2][2] for(int i = 0; i < GRID_SIZE; i++) total += Arr[i][i]; // cout << "diaganal top to bottom = " << total << endl; return total; } double sum_Of_BackDiagonal(const double Arr[][GRID_SIZE]) { double total = 0; // for (int row = 0, column = (GRID_SIZE - 1); row < GRID_SIZE; row++, column--) // total += arr[row][column]; // OR // [][][x] [0][2] // [][x][] [1][1] // [x][][] [2][0] int column = (GRID_SIZE - 1); // 3 - 1 = 2 for (int row = 0; row < GRID_SIZE; row++) { total += Arr[row][column]; column--; } // cout << "diaganal bottom to top = " << total << endl; return total; } bool isLoShuSquare(const double Arr[][GRID_SIZE]) { if( sum_Of_Row(Arr) == 15 && sum_Of_Column(Arr) == 15 && sum_Of_MainDiagonal(Arr) == 15 && sum_Of_BackDiagonal(Arr) == 15 ) return true; else return false; }Code snapshot: Output 1: Output 2:

Answered: help me solve this in c++ please…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Notes

Create the square by filling the numbers entered from left to right, top to bottom.
Input validation - Do not accept numbers outside the range. Do not accept repeats.
Must use two-dimensional arrays in the implementation.
Functional decomposition — Program should rely on functions that are consistent with the algorithm.

Lo-Shu Magic Square
loShu.cpp
The Lo Shu Magic Square is a grid with 3 rows and 3 columns as shown below:
492
357
816
The grid contains the numbers 1 through 9 exactly.
The sum of each row, each column, and each diagonal all add up to the same number:
15
492 15
357 15
8 16 15
15
15 15 15

Input Validation
Microsoft Visual Studio Debug Console
Lo Shu Magic Square
Creating Lo Shu Square
Enter Nine Numbers (1-9)
Number 1: 1
Number 2: 2
Number 3: 2
Error ...
2 is already in the Lo Shu Square. Try again
Number 3: 3
Number 4: 4
Number 5: 5
Number 6: 10
Error ... Invalid number. Try again
Number 6: 6
Number 7: 7
Number 8: 8
Number 9: 9
|| 1 | 2 | 3 |
| 4 | 5 | 6 |
| 7 | 8 | 9 |
Sorry ... this is not a Lo Shu Magic Square
Would you like to try again (y/n)? n

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.