top of page

소스 코드 제출

공개·회원 50명

손유준손유준

숙제

# n, m = map(int, input().split(" "))
# x, y, z = map(int, input().split(" "))
# cell = [[0 for _ in range(n)] for _ in range(m)]
# cell_new = [[0 for _ in range(n+2)] for _ in range(m+2)]
# for i in range(m):
#     cell[i] = list(map(int, input().split(" ")))

# cell.insert(0, [0]*n)
# cell.append([0]*n)
# for i in range(len(cell)):
#     cell[i].insert(0, 0)
#     cell[i].append(0)


        
# k = int(input())
# neighbor = [[-1, 1], [0, 1], [1, 1], [-1, 0], [1, 0], [-1, -1], [0, -1], [1, -1]]


# for a in range(k):
#     for i in range(1, n+1):
#         for j in range(1, m+1):
        
#             count = 0
        
#             for cell1, cell2 in neighbor:
#                 if cell[i+cell1][j+cell2] == 1:
#                     count += 1

        
#             my = cell_new[i][j]
        
#             if my == 0:
#                 if count == x:
#                     cell_new[i][j] = 1
        
#             if my == 1:
#                 if count < y:
#                     cell_new[i][j] = 0
#                 if count >= z:
#                     cell_new[i][j] = 0
#     for i in range(1, n+1):
#         for j in range(1,m+1):
#             cell[i][j] = cell_new[i][j]

# for i in range(1, n+1):
#     for j in range(1, m+1):
#         print(cell[i][j], end=" ")
#     print()

# dx = [1, 0, -1, 0]
# dy = [0, 1, 0, -1]

# N = int(input())
# a = [[0 for _ in range(N)] for _ in range(N)]

# i, j = 0, 0  
# mode = 0    
# for b in range(1, N**2 + 1):
#     a[i][j] = b
#     ni = i + dy[mode]
#     nj = j + dx[mode]
    

#     if ni < 0 or ni >= N or nj < 0 or nj >= N or a[ni][nj] != 0:
#         mode = mode+1 if mode != 3 else 0
#         ni = i + dy[mode]
#         nj = j + dx[mode]
    
#     i, j = ni, nj

# for row in a:
#     print(" ".join(map(str, row)))

# n = int(input())
# snail_matrix(n)

# m, n = map(int, input().split(" "))
# a = [[0 for _ in range(n)]for _ in range(m)]
# b= 1

# for k in range(n+m-1):
#     for i in range(m):
#         for j in range(n):
#             if i + j == k:
#                 a[i][j] = b
#                 b += 1

# for row in a:
#     print(" ".join(map(str, row)))

# N = int(input())
# a = []
# for i in range(1, N+1):
#     a.append([0]*i)
# for i in range(N):
#     a[i][0] = int(input())
    
# for i in range(1, N):
#     for j in range(i, N):
#         a[j][i] = a[j][i-1] - a[j-1][i-1]


# for row in a:
#     print(" ".join(map(str, row)))

n = int(input())
a = [[0] * n for _ in range(n)]

i, j = 0, n // 2

for k in range(1, n * n + 1):
    a[i][j] = k
    ni, nj = (i - 1) % n, (j + 1) % n

    if a[ni][nj]:
        i = (i + 1) % n 
    else:
        i, j = ni, nj

for row in a:
    print(" ".join(map(str, row)))

3회 조회
주소 : 경기도 용인시 광교중앙로 302 블루 스퀘어 602호
연락처 : 031) 216 - 1546 ,     031) 215 - 1546
사업자등록번호 : 465-92-00916
​학원 등록 제 4603호
bottom of page