Magic squares of doubly even order: Difference between revisions
Content added Content deleted
m (→{{header|Java}}: less obscure) |
m (→{{header|Java}}: small change) |
||
Line 59: | Line 59: | ||
int[][] result = new int[n][n]; |
int[][] result = new int[n][n]; |
||
for (int r = 0, i = 0; r < n; r++) |
for (int r = 0, i = 0; r < n; r++) { |
||
for (int c = 0; c < n; c++, i++) { |
for (int c = 0; c < n; c++, i++) { |
||
int bitsPos = c / mult + (r / mult) * 4; |
int bitsPos = c / mult + (r / mult) * 4; |
||
result[r][c] = (bits & (1 << bitsPos)) != 0 ? i + 1 : size - i; |
|||
result[r][c] = value; |
|||
} |
} |
||
} |
|||
return result; |
return result; |
||
} |
} |