結果

問題 No.401 数字の渦巻き
ユーザー ys
提出日時 2018-08-19 08:06:20
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 33 ms / 2,000 ms
コード長 1,454 bytes
コンパイル時間 293 ms
コンパイル使用メモリ 12,800 KB
実行使用メモリ 11,008 KB
最終ジャッジ日時 2024-11-08 18:54:47
合計ジャッジ時間 2,359 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

n = int(input())
T = [[0] * n for i in range(n)]
i, j = 0, 0
k = 1
d = (0, 1)
while True:
    T[i][j] = k
    if k == n ** 2:
        break
    if d == (0, 1):
        for dx, dy in [(0, 1), (1, 0), (0, -1), (-1, 0)]:
            nx, ny = i + dx, j + dy
            if 0 <= nx < n and 0 <= ny < n and T[nx][ny] == 0:
                i, j = nx, ny
                d = (dx, dy)
                k += 1
                break
    elif d == (1, 0):
        for dx, dy in [(1, 0), (0, -1), (-1, 0),(0, 1)]:
            nx, ny = i + dx, j + dy
            if 0 <= nx < n and 0 <= ny < n and T[nx][ny] == 0:
                i, j = nx, ny
                d = (dx, dy)
                k += 1
                break
    elif d == (0, -1):
        for dx, dy in [(0, -1), (-1, 0),(0, 1), (1, 0)]:
            nx, ny = i + dx, j + dy
            if 0 <= nx < n and 0 <= ny < n and T[nx][ny] == 0:
                i, j = nx, ny
                d = (dx, dy)
                k += 1
                break
    else:
        for dx, dy in [(-1, 0),(0, 1), (1, 0), (0, -1)]:
            nx, ny = i + dx, j + dy
            if 0 <= nx < n and 0 <= ny < n and T[nx][ny] == 0:
                i, j = nx, ny
                d = (dx, dy)
                k += 1
                break
S = [[""] * n for i in range(n)]
for i in range(n):
    for j in range(n):
        s = str(T[i][j])
        S[i][j] = (3 - len(s)) * "0" + s
for i in range(n):
    print(" ".join(map(str, S[i])))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0