Magic squares of singly even order: Difference between revisions

* [http://www.1728.org/magicsq3.htm Singly Even Magic Squares (1728.org)]<br><br>

<br><br>

 

=={{header|Befunge}}==

The size, ''N'', is specified by the first value on the stack. In the example below it is set to 6, but adequate space has been left in the code to replace that with a larger value if desired.

 

\00g/10g/3*4vv>0g\-1-30g+1+10g%10g*\30g+1+10g%1+ +

:%4+*2/g01g0<vv4*`\g02\!`\0:-!-g02/2g03g04-3*2\-\3

 

{{out}}

=={{header|C}}==

Takes number of rows from command line, prints out usage on incorrect invocation.

#include<stdlib.h>

#include<ctype.h>

return 0;

}

Invocation and Output:

<pre>

 

Magic constant: 111

</pre>

 

=={{header|C++}}==

#include <iostream>

#include <sstream>

return 0;

}

{{out}}

<pre>

=={{header|D}}==

{{trans|Java}}

import std.exception;

import std.stdio;

return result;

}

 

=={{header|Elixir}}==

[[wp:Conway's LUX method for magic squares]]:

@lux %{ L: [4, 1, 2, 3], U: [1, 4, 2, 3], X: [1, 4, 3, 2] }

end

 

 

{{out}}

 

=={{header|FreeBASIC}}==

' compile with: fbc -s console

' singly even magic square 6, 10, 14, 18...

Print : Print "hit any key to end program"

Sleep

{{out}}

<pre>Single even magic square size: 6*6

=={{header|Go}}==

{{trans|Java}}

 

import (

}

fmt.Printf("\nMagic constant: %d\n", (n*n+1)*n/2)

 

{{out}}

=={{header|Haskell}}==

Using [[wp:Conway's LUX method for magic squares|Conway's LUX method for magic squares]]

import Data.List (transpose, intercalate)

import Data.Maybe (fromJust, isJust)

putStrLn $ unlines (table " " (fmap show <$> test))

print $ checked test

{{Out}}

<pre>32 29 4 1 24 21

Using the Strachey method:

 

odd =: i:@<.@-: |."0 1&|:^:2 >:@i.@,~

t =: ((*: * i.@4:) +"0 2 odd)@-:

d =: ((lm * {.@t) + -.@lm * {:@t)

m =: (a ,"1 c) , d ,"1 b

 

{{Out}}

77 6 16 26 279 280 290 300 310 158 87 97 107 117 118 209 219 229

</pre>

 

=={{header|Java}}==

 

public static void main(String[] args) {

return result;

}

 

<pre>35 1 6 26 19 24

 

Magic constant: 111</pre>

 

=={{header|Julia}}==

{{trans|Lua}}

if iseven(order)

order += 1

check(msq)

end

With order 6:

35 30 31 8 3 4

=={{header|Kotlin}}==

{{trans|Java}}

 

fun magicSquareOdd(n: Int): Array<IntArray> {

}

println("\nMagic constant ${(n * n + 1) * n / 2}")

 

{{out}}

See [[Magic_squares/Lua]].

 

 

 

{{out}}

<pre>35 1 6 26 19 24

3 32 7 21 23 25

4 36 29 13 18 11

 

 

 

 

=={{header|Phix}}==

{{trans|FreeBASIC}}

{{out}}

<pre>

=={{header|Python}}==

{{trans|Lua}}

import math

from sys import stdout

stdout.write("Singly Even Magic Square")

display(build_sems(6))

{{out}}

<pre>Singly Even Magic Square - 6 x 6

[5,] 30 5 34 12 14 16

[6,] 4 36 29 13 18 11</pre>

 

=={{header|Ruby}}==

 

n.times.map{|i| n.times.map{|j| n*((i+j+1+n/2)%n) + ((i+2*j-5)%n) + 1} }

end

end

 

{{out}}

<pre>

===LUX method===

[[wp:Conway's LUX method for magic squares]]

attr_reader :square

LUX = { L: [[4, 1], [2, 3]], U: [[1, 4], [2, 3]], X: [[1, 4], [3, 2]] }

end

 

 

{{out}}

 

=={{header|Rust}}==

 

fn main() {

})

.collect::<Vec<Vec<_>>>()

{{out}}

<pre>

6 | 4 36 29 13 18 11 |

+-------------------------------+</pre>

 

=={{header|zkl}}==

{{trans|Java}}

fcn init(n){ var result=magicSquareSinglyEven(n) }

fcn toString{

result

}

{{out}}

<pre>