자본주의를 살아가는 코린이

A = [[0 for _ in range(101)] for _ in range(101)] result = 0 paper_count = int(input()) for _ in range(paper_count): width, height = list(map(int, input().split(' '))) for x in range(width, width+10): for y in range(height, height+10): A[x][y] = 1 for i in A: result += i.count(1) print(result)

A = [] max_len = 0 result_str = '' for _ in range(5): input_list = input() if max_len x: result_str += A[y][x] print(result_str)

A = [] result_val = 0 result_row = 0 result_column = 0 for _ in range(9): A.append(list(map(int, input().split(' ')))) for i in range(0,len(A)): for j in range(0,len(A[i])): if A[i][j] > result_val: result_val = A[i][j] result_row = i result_column = j print(result_val) print(result_row+1, result_column+1)

더 간단한 코드는 아래 나와있습니다. 2023.06.17 - [알고리즘/2차원 배열(array2)] - 백준 2566 python(2번) 백준 2566 python(2번) A = [] result_val = 0 result_row = 0 result_column = 0 for _ in range(9): A.append(list(map(int, input().split(' ')))) for i in range(0,len(A)): for j in range(0,len(A[i])): if A[i][j] > result_val: result_val = A[i][j] result_row = i result_column = j pri jacorinne.tistory.com A = [] max_dict = {} fo..

row, column = list(map(int, input().split(' '))) A = [] B = [] result_list = [[0 for _ in range(column)] for _ in range(row)] for x in range(0, row): A.append(list(map(int, input().split(' ')))) for y in range(0, row): B.append(list(map(int, input().split(' ')))) for n in range(0, row): for m in range(0, column): result_list[n][m] = A[n][m] + B[n][m] for l in result_list: print(' '.join(map(str,..