본문 바로가기

알고리즘 문제 풀기/Codeup

Codeup 1521 - 인삼밭(택배 수령) Codeup 1521 - 인삼밭(택배 수령) k, n = map(int, input().split())sun_shield = 0matrix = []​for i in range(k): input_matrix = list(map(int, input().split())) matrix.append(input_matrix)​for i in range(0, k): for j in range(0, k): if (matrix[i][j] != -1) and (1
Codeup 1514 - 레이저 체스 Codeup 1514 - 레이저 체스 x1, y1 = map(int, input().split())x2, y2 = map(int, input().split())x3, y3 = map(int, input().split())matrix = [[0]*7 for i in range(7)]​for i in range(0, 7): matrix[3][i] = 1​if x1 == 4: for i in range(0, 7): matrix[i][y1-1] = 1​if x2 == 4: for i in range(0, 7): matrix[i][y2-1] = 1​if x3 == 4: for i in range(0, 7): matrix[i][y3-1] = 1​for index in range(2): if matrix[x1-1][..
Codeup 1513 - 지그재그 배열 3 Codeup 1513 - 지그재그 배열 3 n = int(input())matrix = [[0]*n for i in range(n)]cnt = 1row = n-1col = 0sw = False​for i in range(n, 0, -1): if sw == False: for j in range(0, i): matrix[row][col] = cnt if j == i-1: row += 1 cnt += 1 sw = True else: row -= 1 col += 1 cnt += 1 else: for j in range(0, i): matrix[row][col] = cnt if j == i-1: col += 1 cnt += 1 sw = False else: row += 1 col -= 1 cnt += 1​for..
Codeup 1512 - 숫자 등고선 Codeup 1512 - 숫자 등고선 n = int(input())matrix = [[0]*n for i in range(n)]row, col = map(int, input().split())​​def abs(num): return num if num > 0 else -num​​def get_number(a, b): return abs(a-(row-1)) + abs(b-(col-1)) + 1​​for i in range(0, n): for j in range(0, n): print(get_number(i, j), end=' ') print()
Codeup 1509 - 진격 후 결과 http://codeup.kr/problem.php?id=1509 Codeup 1509 - 진격 후 결과 matrix = []isProblem = False​for i in range(10): board = list(map(int, input().split())) matrix.append(board)​horse = list(map(int, input().split()))​for i in range(0, 10): if horse[i] == 0: continue isProblem = False for j in range(9, -1, -1): if matrix[j][i] != 0: if matrix[j][i] > 0: print(i+1, 'crash') isProblem = True break else: pr..
Codeup 1508 - 나도 IQ 150 http://codeup.kr/problem.php?id=1508 Codeup 1508 - 나도 IQ 150 n = int(input())matrix = []​for i in range(1, n+1): tmp = [0] * i matrix.append(tmp)​for i in range(0, n): num = int(input()) matrix[i][0] = num for j in range(1, len(matrix[i])): matrix[i][j] = matrix[i][j-1] - matrix[i-1][j-1]​for i in range(0, n): for j in range(0, len(matrix[i])): print(matrix[i][j], end=' ') print()
Codeup 1507 - 4개의 직사각형 넓이 http://codeup.kr/problem.php?id=1507 Codeup 1507 - 4개의 직사각형 넓이 xxxxxxxxxxmatrix = [[0]*100 for i in range(100)]cnt = 0​for i in range(4): x1, y1, x2, y2 = map(int, input().split())​ for x in range(x1, x2): for y in range(y1, y2): matrix[x][y] = 1​for i in range(0, 100): for j in range(0, 100): if matrix[i][j] == 1: cnt += 1​print(cnt)
Codeup 1506 - 2차원 배열 채우기 4(역달팽이 배열) http://codeup.kr/problem.php?id=1506 Codeup 1506 - 2차원 배열 채우기 4(역달팽이 배열) n = int(input())matrix = [[0]*n for i in range(n)]cnt = 0offset = 0row = ncol = n​while row > 0 and col > 0: for i in range(offset, offset+row): cnt += 1 matrix[i][offset] = cnt​ for i in range(offset+1, offset+col): cnt += 1 matrix[offset+row-1][i] = cnt​ for i in range(offset+row-2, offset-1, -1): cnt += 1 matrix[i][offse..

티스토리툴바