Problem
Given N (N=3 or 4), print all NxN magic squares using recursion. A magic square is an NxN grid with numbers 1..N^2, each used once, so all rows, columns, and both diagonals sum to the same value.
Input format
Input
input.txt
- A single integer N (3 or 4)
Output format
Output
output.txt
- Each magic square as N lines of N numbers. Separate squares with a blank line.
Example
input
3
output
8 1 6 3 5 7 4 9 2 (and others)
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
3
Expected output
8 1 6 3 5 7 4 9 2 (and others)
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc