Submission #71702321

Source Code Expand

import numpy as np

N=int(input())
a = np.zeros((N,N))
n = int((N-1)/2)
a[0][n]=1
r,c = 0,n
for i in range(N**2 -1): 
  x,y = int((r-1)%N),int((c+1)%N)
  if a[x][y] == 0:
    a[x][y] = i+2
  else:
    x,y = int((r+1)%N),int(c)
    a[x][y] = i+2
  r,c = x,y
int_a = a.astype(int)
for row in int_a:
  print(*row)

Submission Info

Submission Time
Task B - Magic Square
User huwaso
Language Python (CPython 3.13.7)
Score 200
Code Size 327 Byte
Status AC
Exec Time 75 ms
Memory 26576 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 13
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt
All 00_sample_00.txt, 00_sample_01.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 67 ms 26356 KiB
00_sample_01.txt AC 68 ms 26216 KiB
01_test_00.txt AC 69 ms 26196 KiB
01_test_01.txt AC 69 ms 26172 KiB
01_test_02.txt AC 69 ms 26216 KiB
01_test_03.txt AC 69 ms 26184 KiB
01_test_04.txt AC 71 ms 26272 KiB
01_test_05.txt AC 71 ms 26164 KiB
01_test_06.txt AC 72 ms 26388 KiB
01_test_07.txt AC 73 ms 26420 KiB
01_test_08.txt AC 75 ms 26432 KiB
01_test_09.txt AC 75 ms 26576 KiB
01_test_10.txt AC 75 ms 26380 KiB