Submission #71703337


Source Code Expand

N = int(input())
G = [[0] * N for _ in range(N)]

r = 0
c = (N-1)//2
k = 1
G[r][c] = k

for _ in range(N*N):
  if G[(r-1)%N][(c+1)%N] == 0:
    G[(r-1)%N][(c+1)%N] = k+1
    r = (r-1)%N
    c = (c+1)%N
    k+=1
  elif G[(r+1)%N][c] == 0:
    G[(r+1)%N][c] = k +1
    r= (r+1)%N
    c =c
    k += 1
  else:
    break

for i in range(N):
  for j in range(N):
    print(G[i][j],end=" ")
  print('')

Submission Info

Submission Time
Task B - Magic Square
User Aoi4947
Language Python (CPython 3.13.7)
Score 200
Code Size 420 Byte
Status AC
Exec Time 17 ms
Memory 9656 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 11 ms 9144 KiB
00_sample_01.txt AC 10 ms 9016 KiB
01_test_00.txt AC 10 ms 9032 KiB
01_test_01.txt AC 11 ms 9096 KiB
01_test_02.txt AC 11 ms 9252 KiB
01_test_03.txt AC 11 ms 9080 KiB
01_test_04.txt AC 12 ms 9280 KiB
01_test_05.txt AC 13 ms 9288 KiB
01_test_06.txt AC 14 ms 9548 KiB
01_test_07.txt AC 15 ms 9548 KiB
01_test_08.txt AC 15 ms 9388 KiB
01_test_09.txt AC 15 ms 9656 KiB
01_test_10.txt AC 17 ms 9620 KiB