Hyperreal, EONS Architecture

# Python3 # 1099 : [기초-종합+배열] 성실한 개미 # https://codeup.kr/problem.php?id=1099 MAX_VALUE = 10 data = [] #2차원 리스트 for i in range(10): temp = [int(x) for x in input().split()] data.append(temp) now_x, now_y = 1, 1 while True: if data[now_x][now_y] == 0: # 현재위치가 빈공간이면 data[now_x][now_y] = 9 if data[now_x][now_y+1] == 0: #오른쪽이 빈공간이면 now_y += 1 elif data[now_x][now_y+1] == 1 and data[now_x+1][now_y] !=..

# Python3 # 1098 : [기초-종합+배열] 설탕과자 뽑기 # https://codeup.kr/problem.php?id=1098 A, B = map(int, input().split()) result = [[0 for i in range(B)] for j in range(A)] n = int(input()) for i in range(n): l, d, x, y = map(int, input().split()) for j in range(l): if d == 0: #가로막대 result[x-1][y-1+j] = 1 elif d == 1: result[x-1+j][y-1] = 1 for i in range(A): for j in range(B): print(result[i][j], end=' ')..

# Python3 # 1097 : [기초-종합+배열] 바둑알 십자 뒤집기 # https://codeup.kr/problem.php?id=1097 MAX_VALUE = 19 data = [[0 for i in range(MAX_VALUE)] for j in range(MAX_VALUE)] for i in range(MAX_VALUE): temp = list(map(int, input().split())) for j in range(MAX_VALUE): data[i][j] = temp[j] n = int(input()) for i in range(n): x, y = map(int, input().split()) for k in range(MAX_VALUE): if data[x - 1][k] == 1: dat..