arr = [[0,1,2,3],[4,5,6,7]]
0 | 1 | 2 | 3 |
---|---|---|---|
4 | 5 | 6 | 7 |
3
1 2 3
4 5 6
7 8 9
N = int(input())
arr = [list(map(int,input().split())) for _in range(N)]
3
123
456
789
N= int(input())
arr = [list(map(int,input())) for _in range(N)]
n x m배열의 n*m 개의 모든 원소를 빠짐없이 조사하는 방법
# i행의 좌표
# j열의 좌표
for i in range(n) :
for j in range(m) :
Array[i][j]
arr[0...N-1][0...N-1] # NxN배열
di[] <- [-1,1,0,0]
dj[] <- [0,0,-1,1]
# [-1,0]상 [1,0] 하 [0,-1] 좌 [0,1] 우
di = [0 1, 0, -1] #우하좌상
dj = [1,0, -1, 0]
# for k in range(4) :
# ni = i + di[k]
# nj = j + dj[k]
# if 0<=ni<N and 0<=nj<M :
# arr[ni][nj]
arr = [[1,2,3],[4,5,6],[7,8,9]]
N = 3
for i in range(N) :
for j in range(N) :
for di, dj in [(0, 1), (1, 0), (0, -1), (-1, 0)] :
ni = i + di
nj = j + dj
if 0 <= ni < N and 0 <= nj < N:
print(i,j,arr[ni][nj])
print()
# 0 앞뒤로 붙이기
N = int(input())
#arr1 = [0]+list(map(int,input().split()))+[0]
arr2 = [[0]*(N+1)] + [[0]+list(map(int,input().split())) for _ in range(N)]
pprint(arr2)
arr = [[1,2,3],[4,5,6],[7,8,9]]
for i in range(3):
for j in range(3) :
if i < j :
arr[i][j],arr[j][i] = arr[j][i],arr[i][j]