提出 #43357597

---

ソースコード 拡げる

import sys
import itertools
import math
import collections
import bisect
import heapq

input = sys.stdin.readline
sys.setrecursionlimit(10**7)

INF = 10**18


def main():
    N = int(input())
    A = [list(input().strip()) for _ in range(N)]

    B = [[None] * N for _ in range(N)]

    for i in range(1, N-1):
        for j in range(1, N-1):
            B[i][j] = A[i][j]

    for j in range(N-1):
        B[0][j+1] = A[0][j]
    B[0][0] = A[1][0]

    for j in range(N-1):
        B[N-1][j] = A[N-1][j+1]
    B[N-1][N-1] = A[N-2][N-1]

    for j in range(1, N-1):
        B[j][0] = A[j+1][0]

    for j in range(1, N-1):
        B[j][N-1] = A[j-1][N-1]

    for i in B:
        print("".join(i))


main()

提出情報

ジャッジ結果