one by one ◼◻◼◻

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 import sys from collections import deque line = sys.stdin.readline().split() N, K =int(line[0]),int(line[1]) move = deque() move.append(N) visit = [0] * (100000+1) while move: loc= move.popleft() if loc == K: print(visit[loc]) break else: for nx in (loc-1, loc+1, loc*2): if 0

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 # 단지 번호붙이기 import sys from collections import deque dx = [-1,1,0,0] dy = [0,0,-1,1] N = int(sys.stdin.readline().split()[0]) x,y = N,N data = [[0] * y for _ in range(x)] visit = [[0] * y for _ in range(x)] for i in range(x): line = list(sys.stdin.readline().sp..

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 import sys from collections import deque dx = [-1,1,0,0] dy = [0,0,-1,1] x, y = (map(int, sys.stdin.readline().split())) data = [[0] * y for _ in range(x)] visit = [[0] * y for _ in range(x)] for i in range(x): line = list(sys.stdin.readline().split()[0]) for j, temp in enumerate(line): data[i][j] = int(temp) togo =..

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 import sys N = int(sys.stdin.readline()) for _ in range(N): items = list(map(int, sys.stdin.readline().split())) a,b = items[0]%10, items[1] temp = a last_part = [a] if a == 0: print(10) continue while True: temp*= a if len(last_part)!=1 and temp%10 == a: break else: last_part.append(temp%10) loop_len = len(last_part) print(last_part[b%..

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 def solution(triangle): d = [[] for _ in range(len(triangle))] for i,item in enumerate(triangle): if i==0: d[i] = [item[0]] else: for j,num in enumerate(item): if j==0: d[i].append(d[i-1][j] + num) elif j == len(item)-1: d[i].append(d[i-1][j-1] + num) else: d[i].append(max(d[i-1][j] + num,d[i-1][j-1] + num)) answer = max(d[-1]) return answer Colored by Colo..

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 from collections import defaultdict def solution(genres, plays): answer = [] genres_count = defaultdict(int) genres_song = defaultdict(list) for i, (g,p) in enumerate(zip(genres, plays)): genres_count[g] += p genres_song[g].append([p,i]) G = len(genres_count) for _ in range(G): count_nums = list(genres_count.values()) gen..

1 2 3 4 5 6 7 8 9 10 11 12 from collections import defaultdict def solution(clothes): clot = defaultdict(list) for item in clothes: clot[item[1]].append(clot[item[0]]) answer = 1 for key in clot.keys(): answer *= (len(clot[key])+1) return answer-1 cs

123456789101112131415stoi = {'zero' : '0','one' : '1','two' : '2','three' : '3','four' : '4','five' : '5','six' : '6','seven' : '7','eight' : '8','nine' : '9'}def solution(s): for string_num, num in stoi.items(): s = s.replace(string_num, num) answer = int(s) return answercs

1 2 3 4 5 6 7 8 9 10 11 def solution(lottos, win_nums): cnt_0 = lottos.count(0) same = 0 for num in lottos: if num in win_nums:same +=1 low = min(7-same,6) high = min(7-(same+cnt_0),6) answer = [high, low] return answer cs

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 def solution(new_id): allow = list('abcdefghijklmnopqrstuvwxyz-_.1234567890') new_id = new_id.lower() print(new_id) step_2= [] for c in new_id: if c in allow: step_2.append(c) new_id = ''.join(step_2) print(new_id) step_3 = [] continue_flag = False for c in new_id: if ..