n = int(input()) n = str(n) left = 0 right = 0 for i in range(0,len(n)//2): left += int(n[i]) for i in range(len(n)//2,len(n)): right += int(n[i]) if left == right: print('LUCKY') else: print('READY') n = input() length = len(n) summary = 0 for i in range(length // 2): summary += int(n[i]) for i in range(length // 2, length): summary -= int(n[i]) if summary == 0: print("LUCKY") else: print('READ..
이것이 취업을 위한 코딩 테스트이다.
팀 결성 def find_parent(parent, x): if parent[x] != x: parent[x] = find_parent(parent, parent[x]) return parent[x] def union_parent(parent, a, b): a = find_parent(parent, a) b = find_parent(parent, b) if a < b: parent[b] = a else: parent[a] = b n, m = map(int, input().split()) parent = [0] * (n+1) for i in range(n+1): parent[i] = i for _ in range(m..
전보 import sys import heapq INF = int(1e9) input = sys.stdin.readline n, m, c = map(int, input().split()) graph = [[] for _ in range(n+1)] distance = [INF] * (n+1) for _ in range(m): x, y, z = map(int, input().split()) graph[x].append((y,z)) start = c def dijstra(start): q = [] heapq.heappush(q, (0, start)) while q: dist, now = heapq.heappop(q) i..
효율적인 화폐 구성 n, m = map(int, input().split()) money_size = [] for i in range(n): money_size.append(int(input())) money_size.sort() array = [-1] * 1001 for money in money_size: array[money] = 1 for i in range(m+1): for j in money_size: if array[i] != -1 and array[i + j] == -1 and i + j
