2024.11.03 (py)

#
# a = [0 for _ in range(10)]
# print(a)
#
# # for _ in range(10) :
# #     print('a')
#
# [[A[i][j] + B[i][j] for j in range(len(A[0]))] for i in range(len(A)]
#
'''
A = [ [0 for _ in range(3) ] for _ in range(4)]
B = [ [0 for _ in range(3) ] for _ in range(4)]
# 4 * 3
# print(A)
#
#
# len(A) : 행개수
# len(A[0]) : 열개수

C = [ [ (A[i][j] + B[i][j]) for j in range(3) ] for i in range(4)]



for i in range(len(A)) :
    for j in range(len(A[0])) :
        C[i][j] = (A[i][j] + B[i][j])

return C

list
딕셔너리
튜플


# mA, nA = isMatrix(A)
#          (0,0)

a, b = map(int, input().split())


x if condition else y

c = x if a==0 else y




n = 5
A =  [[1 if i == j else 0 for j in range(n)] for i in range(n)]

print(A)


n=int(input())                        -----1492
arr = list(map(int,input().split()))

sum=[0]*n
sum[0]=arr[0]

for i in range (1,n):
    sum[i]=sum[i-1]+arr[i]

for x in sum:
    print (x, end=' ')



n,m=map(int,input().split())           -----1493
arr=[list(map(int,input().split())) for _ in range(n)]

sum=[[0 for i in range(m+1)] for j in range(n+1)]

for i in range (1,n+1):
    for j in range(1,m+1):
        sum[i][j]=arr[i-1][j-1]+(sum[i][j]+sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1])

for i in range(1,n+1):
    for j in range(1,m+1):
        print (sum[i][j],end=' ')
    print()


'''