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…

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. 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.

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. 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.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 4RQ

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

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

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.

Similar questions

A theater seating chart is implemented as a two-dimensional array of ticket prices,Like this10 10 10 10 10 10 10 10 10 1010 10 10 10 10 10 10 10 10 1010 10 10 10 10 10 10 10 10 1010 10 20 20 20 20 20 20 10 1010 10 20 20 20 20 20 20 10 1010 10 20 20 20 20 20 20 10 1020 20 30 30 40 40 30 30 20 2020 30 30 40 50 50 40 30 30 2030 40 50 50 50 50 50 50 40 30 Write a program that prompts users to pick either a seat or price. Mark sold seats by changing theprice to 0. When a user specifies a seat, make sure it is available. When a user specifies a price,find any seat with that price.
A(n) __________ is an array of characters.
An 8-puzzle game consists of 8 sliding tiles, numbered by digits from 1 to 8 and arranged in a 3x3 array of nine cells. A configuration in the puzzle refers to some specific arrangement of the tiles in the array, where each digit is arranged into a different cell. One of the cell is empty (represented by a "*") and any adjacent tile can be moved into the empty cell. An example below c | 1 | 2 | 3 b | 4 | * | 5 a | 6 | 7 | 8------------------ Y/X a b c We use a 3-tuple (number, X, Y) to represent the position of a digit, where number is the actual digit, and (X,Y) is the coordinate value of the digit in the current configuration (e.g., in the configuration above, we have (5,c,b), meaning the digit 5 is at the position of (c,b)).Hence the configuration in the example can be represented as:[(1,a,c), (2,b,c), (3,c,c), (4,a,b), (5,c,b), (6,a,a), (7,b,a), (8,c,a)].Any move of an adjacent tile into the empty cell moves the current configuration into the one adjacent to it.…
"John is very interested in history and all the generations of his family. He does a lot of research and realizes that he is descended from the great Mayan dynasty. After a lot of searching through ancient records and the latest records of the society, he is able to find out all the parent-child relationships in his family all the way from the great emperor Ming of the dynasty to himself These relationships are given in the form of a linear array where the emperor is at the first position and his children are at pos (2i + 1) and (2i + 2) Subject: Java Programming This is the pattern followed throughout. Henry wants to figure out all the siblings of the person X from the data. Return the sorted list of all of john's siblings. If no sibling return {-1} input 1: N, the length of the arrayinput2: An array representing the ancestral treeinput 3: X, the person whose siblings are sought. output - return the array of all siblings in increasingly sorted order. Examples : input…
ABC zoo wants to keep track of how many pounds of food each of its four monkeys eats each day during a typical week. Stores this information in a two dimensional 4× 7 array, where each row represents a different monkey and each column represents a different day of the week. First let the user input the data of food eaten by each monkey then it should create a report that includes the following information: Average amount of food eaten by each monkey for the whole week. The least amount of food eaten during the week by any one monkey.
A magic square is an n by n matrix in which each of the integers 1, 2, 3...n appears exactly once and all column sums, row sums, and diagonal sums are equal. For example, the following is a 5 by 5 magic square in which all rows, columns and diagonals sum to 65. 17 24 1 8. 15 23 7 14 16 4 6. 13 20 22 10 12 19 21 3 11 18 25 9 The following is a procedure for constructing an n by n magic square for any ODD integer n. Place 1 in the middle of the top row. Then.m after integer k has been placed, move up one row and one column to the right to place the next integer k+1 unless one of the following occurs: If a move takes you above the top row in the jth column, move to the bottom of the jth column and place k+1 there. If the move takes you outside to the right of the square in the ith row place k+1 in the ith row in the left side. If the move takes you to an already filled square or if you move out of the square at the upper right hand corner place k+1 immediately below k. Write a C++ program…
CCC '13 J1 - Next in line Canadian Computing Competition: 2013 Stage 1, Junior #1 You know a family with three children. Their ages form an arithmetic sequence: the difference in ages between the middle child and youngest child is the same as the difference in ages between the oldest child and the middle child. For example, their ages could be 5, 10 and 15, since both adjacent pairs have a difference of 5 years. Given the ages of the youngest and middle children, what is the age of the oldest child? Input Specification The input consists of two integers, each on a separate line. The first line is the age Y of the youngest child (0
A prime number is an integer number greater than 1 that has no positive divisors other than one and itself. The table below are examples of some primes numbers. 2 5 7 31 73 127 179 181 191 193 41 83 43 79 131 137 139 89 233 239 241 283 293 307 353 359 367 373 431 419 421 433 467 479 487 491 251 311 First 100 Prime Numbers Accept This Assignment Purpose #69568886 11 47 97 149 197 257 313 379 439 499 13 53 101 17 59 103 151 199 263 269 317 383 389 443 449 503 509 19 61 107 157 163 211 223 227 Enter an integer to test: $#y6@ Invalid integer value! Try again 67 109 167 405 271 277 331 337 347 401 397 457 461 521 523 Assignment Description Write a program that will prompt the user for an integer n that will be tested to determine if it is a prime number. The best approach is to start by assuming the integer n is a prime number (isPrime=True) and attempting to prove it is not prime by testing it to find a number i that divides it evenly using the modulo (remainder) operator (i.e. n%i==0).…
Moving Magic Square is the name of a game that is based on the concept of a magic square. A magic square is any square array of numbers, usually positive integers, in which the sums of the numbers in each row, each column, and both main diagonals are the same. For example, the 3 x 3 square in Table 1 is a magic square because the sum of every row, every column and the two diagonals is 15. Table 1 6 18 753 294 The game, Moving Magic Square, is played on any n x n grid containing positive integer numbers from 1, ..., n². The number n² is the movable number. You can move the number n² in one of four directions (up/down/left/right), and swap n² with the number that is currently occupying that cell. The player wants to move the number n² to reach a goal state such that the sum of the n numbers in every row, column, and both diagonals is equal to k. There are multiple states that satisfy this condition, and you can stop the game when you find the first goal state. In a 3 x 3 game, 9 is the…
A popular word game involves finding words from a grid of randomly generatedletters. Words must be at least three letters long and formed from adjoining letters.Letters may not be reused and it is valid to move across diagonals. As an example,consider the following 4 * 4 grid of letters: A B C DE F G HI J K LM N O P The word “FAB” is valid (letters in the upper left corner) and the word “KNIFE”is valid. The word “BABE” is not valid because the “B” may not be reused. Theword “MINE” is not valid because the “E” is not adjacent to the “N”. Write a program that uses a 4 * 4 two-dimensional array to represent the gameboard. The program should randomly select letters for the board. You may wishto select vowels with a higher probability than consonants. You may also wish toalways place a “U” next to a “Q” or to treat “QU” as a single letter. The programshould read the words from the text file words.txt (included on the website withthis book) and then use a recursive algorithm to…
Write a Java application for a grade book using arrays: Create an array to store 20 test grades, random numbers between 0-100, inclusive. Print these 20 grades Calculate and print the average grade Calculate and print the highest and lowest grades
Generate a 2-dimensional array of random letters from a through z. Let the program prompt you to enter the number of rows and columns. Your result should look like, for example: Enter number of row: 3 Enter number of row: 4 c g r u t r q o p k s w Using java programming