문제
출처
코드
def convert(num, base): # 이진법 변환 함수
temp = "0123456789ABCDEF"
q, r = divmod(num, base)
if q == 0:
return temp[r]
else:
# q를 base로 변환
# 즉, n진수의 다음 자리를 구함
return convert(q, base) + temp[r]
def solution(n, t, m, p):
answer = ''
test = ''
for i in range(m*t):
test += str(convert(i, n))
while len(answer) < t:
answer += test[p-1]
p += m
return answer
Python
복사
solution(16, 16, 2, 2)
Python
복사
'13579BDF01234567'
def solution(board, moves):
bucket = []
answer = []
for move in moves:
for i in range(len(board)):
if board[i][move-1] > 0:
bucket.append(board[i][move-1])
board[i][move-1] = 0
if bucket[-1:] == bucket[-2:-1]:
answer += bucket[-1:]
bucket = bucket[:-2]
break
return len(answer)*2
Python
복사