2738 행렬 덧셈

1 N, M=map(int, input().split())
2 arr1=[list(map(int, input().split())) for _ in range(N)]
3 arr2=[list(map(int, input().split())) for _ in range(N)]
4 arr3=[]
5 for _ in range(N):
6 arr3.append([0]*M)
7 for i in range(N):
8 for j in range(M):
9 arr3[i][j]=arr1[i][j]+arr2[i][j]
10 print(arr3[i][j], end=" ")
11 print()

2566 최댓값
1 a = []
2 max_num = -1
3 x = 0
4 y = 0
5 for _ in range(9):
6 a.append(list(map(int, input().split())))

7 for i in range(9):
8 for j in range(9):
9 if max_num < a[i][j]:
10 max_num = a[i][j]
11 x = i + 1
12 y = j + 1
13 else:
14 continue
15print(max_num)
16print(x, y, end = ' ')
10798 세로 읽기
1 words=[]
2 for i in range(5):
3 words.append([0]*15)
4 for i in range(5):
5 word=list(input())
6 leng=len(word)
7 for j in range(leng):
8 words[i][j]=word[j]
10result=""
11for i in range(15):
12 for j in range(5):
13 if words[j][i]==0:
14 continue
15 else:
16 result+=words[j][i]
17print(result)

2563 색종이
1 arr=[]
2 cnt=0
3 for _ in range(100):
4 arr.append([0]*100)
5 a=int(input())
6 for _ in range(a):
7 b, c=map(int, input().split())
8 for i in range(10):
9 for j in range(10):
10 arr[b+i][c+j]=1
11for i in range(100):
12 for j in range(100):
13 if arr[i][j]==1:
14 cnt+=1
15print(cnt)
2167 2차원 배열의 합
1 n, m =map(int, input().split())
2 lst=[]
3 dp = [[0]*(m+1) for _ in range(n+1)]
4 for _ in range(n):
5 lst.append(list(map(int, input().split())))
6 for i in range(1, n+1):
7 for j in range(1, m+1):
8 dp[i][j]=lst[i-1][j-1]+dp[i][j-1]+dp[i-1][j]-dp[i-1][j-1]
9 k=int(input())
10for _ in range(k):
11 i, j, x, y=map(int, input().split())
12 print(dp[x][y]-dp[x][j-1]-dp[i-1][y]+dp[i-1][j-1])

1932 정수 삼각형
1 n=int(input())
2 arr=[]
3 dp=[]
4 sum=0
5 for _ in range(n):
6 arr.append(list(map(int, input().split())))
7 for i in range(1, n+1):
8 dp.append([0]*i)
9 dp[0][0]=arr[0][0]

10for i in range(1, n):

11 for j in range(i+1):
12 if j==0:
13 dp[i][j]=arr[i][j]+dp[i-1][j]
14 elif i==j:
15 dp[i][j]=arr[i][j]+dp[i-1][j-1]
16 else:
17 if dp[i-1][j]>dp[i-1][j-1]:
18 dp[i][j]=arr[i][j]+dp[i-1][j]
19 else:
20 dp[i][j]=arr[i][j]+dp[i-1][j-1]
21for i in range(n):
22 if dp[n-1][i]>sum:
23 sum=dp[n-1][i]
24print(sum)