Head vs breakz

#n 진수 게임 def solution(n, t, m, p): numbers = [] answer =[] for i in range(0,t*m): a = numeral_system(i,n) numbers.append(a) numbers_a= list(''.join(numbers)) for j in range(p-1,t*m,m): answer.append(numbers_a[j]) answer=''.join(answer) return answer rotation = '0123456789ABCDEF' def numeral_system(number , base): q, r = divmod(number, base) n = rotation[r] return numeral_system(q, base) + n if q..

# 괄호변환 def solution(p): if p =="": return "" elif len(p) % 2 == 0: qq = div_val(p,point_val(p)) return qq def point_val(p): a = 0 count = 1 q = list(p) for i in range(len(q)): if q[i]=="(": count +=2 if count == 1: a = i break elif q[i]==")": count -=2 if count == 1: a = i break return a def div_val(p,a): count = [] q = list(p) u =q[:a+1] v =p[a+1:] if check_val(u) ==True : return p[:a+1]+soluti..

#호텔 방 배정 def solution(k, room_number): a = [0 for _ in range(k+1)] b = [] for i in range(len(room_number)): if a[room_number[i]] == 0 : a[room_number[i]] = room_number[i] b.append(room_number[i]) elif a[room_number[i]] != 0 : for j in range(1,len(room_number)-room_number[i]+1): if a[room_number[i]+j] == 0 : a[room_number[i]+j] = room_number[i]+j b.append(room_number[i]+j) answer = b return answe..

#크레인 인형뽑기 def solution(board, moves): box = [] cnt = 0 for i in range(len(moves)): for j in range(len(board)): if board[j][moves[i]-1] != 0 : box.append(board[j][moves[i]-1]) board[j][moves[i]-1] = 0 if len(box) > 1 and box[-1] == box [-2]: cnt += 2 box.pop(-1) box.pop(-1) break else : continue return cnt