結果

問題 No.401 数字の渦巻き
ユーザー tonnnura172
提出日時 2020-04-16 19:28:01
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
RE  
(最新)
AC  
(最初)
実行時間 -
コード長 1,481 bytes
コンパイル時間 277 ms
コンパイル使用メモリ 12,928 KB
実行使用メモリ 11,904 KB
最終ジャッジ日時 2024-10-02 06:28:55
合計ジャッジ時間 2,783 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other RE * 30
権限があれば一括ダウンロードができます

ソースコード

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

import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul, add
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
from decimal import Decimal
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
N = INT()
ans = [[None]*N for _ in range(N)]
d = "r"
pos = [0, 0]
for i in range(1, N**2+1):
    y, x = pos
    ans[y][x] = str(i).zfill(3)
    
    if d == "r":
        if x+1 == N or (x+1 != N and ans[y][x+1]):
            d = "d"
            pos[0] += 1
            continue
        else:
            pos[1] += 1
            continue
    if d == "d":
        if y+1 == N or (y+1 != N and ans[y+1][x]):
            d = "l"
            pos[1] -= 1
            continue
        else:
            pos[0] += 1
            continue
    if d == "l":
        if x-1 == -1 or (x-1 != -1 and ans[y][x-1]):
            d = "u"
            pos[0] -= 1
            continue
        else:
            pos[1] -= 1
            continue
    if d == "u":
        if y-1 == -1 or (y-1 != -1 and ans[y-1][x]):
            d = "r"
            pos[1] += 1
            continue
        else:
            pos[0] -= 1
            continue
for x in ans:
    print(*x)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0