Java Program Problem 4: Magic Square Test A magic square of order n is an arrangement of n × n numbers, usually distinct integers, in a square, such that the n numbers in all rows, all columns, and both diagonals sum to the same constant.
Java Program Problem 4: Magic Square Test A magic square of order n is an arrangement of n × n numbers, usually distinct integers, in a square, such that the n numbers in all rows, all columns, and both diagonals sum to the same constant.
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter8: Arrays And Strings
Section: Chapter Questions
Problem 21PE
Related questions
Question
Java Program
Problem 4: Magic Square Test
A magic square of order n is an arrangement of n × n numbers, usually distinct integers, in a square, such that the n numbers in all rows, all columns, and both diagonals sum to the same constant.
See all rows’, columns’ and diagonal’s sum is same. Write a main method where first you need to input n. Then input n*n integers and form a 2D matrix. Print “YES” if the matrix is magic square and print “NO” Otherwise.
Sample input: 3 2 7 6 9 5 1 4 3 8 |
![Problem 4: Magic Square Test
A magic square of order n is an arrangement of n xn numbers, usually distinct integers, in a
square, such that the n numbers in all rows, all columns, and both diagonals sum to the same
constant.
7
►15
9
5
1
-15
3
8
-15
15
15
15
15
15
See all rows', columns' and diagonal's sum is same. Write a main method where first you need
to input n. Then input n*n integers and form a 2D matrix. Print "YES" if the matrix is magic
square and print "NO" Otherwise.
Sample input:
Output:
3
YES
276
4-](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8c5b8792-d957-4ebe-adb8-73a9dcbc5c73%2F70824c96-eec9-4f9e-bb49-9b6f26dde458%2F03o6re_processed.png&w=3840&q=75)
Transcribed Image Text:Problem 4: Magic Square Test
A magic square of order n is an arrangement of n xn numbers, usually distinct integers, in a
square, such that the n numbers in all rows, all columns, and both diagonals sum to the same
constant.
7
►15
9
5
1
-15
3
8
-15
15
15
15
15
15
See all rows', columns' and diagonal's sum is same. Write a main method where first you need
to input n. Then input n*n integers and form a 2D matrix. Print "YES" if the matrix is magic
square and print "NO" Otherwise.
Sample input:
Output:
3
YES
276
4-
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
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.Recommended textbooks for you
![C++ Programming: From Problem Analysis to Program…](https://www.bartleby.com/isbn_cover_images/9781337102087/9781337102087_smallCoverImage.gif)
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
![C++ for Engineers and Scientists](https://www.bartleby.com/isbn_cover_images/9781133187844/9781133187844_smallCoverImage.gif)
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
![C++ Programming: From Problem Analysis to Program…](https://www.bartleby.com/isbn_cover_images/9781337102087/9781337102087_smallCoverImage.gif)
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
![C++ for Engineers and Scientists](https://www.bartleby.com/isbn_cover_images/9781133187844/9781133187844_smallCoverImage.gif)
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr