Jerry의 컴퓨터 일기 💻

링크🔗https://www.acmicpc.net/problem/1652🗒️파이썬 코드 풀이N = int(input())lst = [list(input()) for _ in range(N)]width = 0 for i in range(N): space = 0 for j in range(N): if lst[i][j] ==".": space += 1 if space == 2: width += 1 else : space = 0length = 0 for j in range(N): space = 0 for i in range(N): if lst[i][j] ==..

링크🔗https://www.acmicpc.net/problem/2621🗒️파이썬 코드 풀이lst = []for _ in range(5): C,N = input().split(" ") N = int(N) lst.append((C,N))lst = sorted(lst,key=lambda x:x[1])rs = 0# 연속성 확인def chk_sequence(): sequence = True for i in range(len(lst)) : if lst[0][1] + i != lst[i][1]: sequence = False return sequence return sequence# 색상 같음 확인 def chk_same_colo..

링크🔗https://www.acmicpc.net/problem/10655🗒️파이썬 코드 풀이N = int(input())x_lst = []y_lst = []for _ in range(N): x,y = map(int,input().split()) x_lst.append(x) y_lst.append(y)sum = 0 for i in range(0,len(x_lst)-1): sum = sum + abs(x_lst[i]-x_lst[i+1]) + abs(y_lst[i]-y_lst[i+1])mn = 1e100for i in range(1,len(x_lst)-1): prev_mid = abs(x_lst[i-1] - x_lst[i]) + abs(y_lst[i-1] - y_lst[i]) ..

링크🔗https://www.acmicpc.net/problem/2583🗒️파이썬 코드 풀이 (DFS)import syssys.setrecursionlimit(10**6)input = sys.stdin.readlineN, M, K = map(int, input().split())lst = [[0] * M for _ in range(N)]for _ in range(K): j1, i1, j2, i2 = map(int, input().split()) for i in range(i1, i2): for j in range(j1, j2): lst[i][j] = 1 di, dj = [0, -1, 0, 1], [1, 0, -1, 0]rs = []def d..