공부하자 동진아

def solution(arr1, arr2):
    answer = []
    
    for idx1 in range(len(arr1)):
        row = []
        for idx2 in range(len(arr2[0])):
            num = 0
            for idx3 in range(len(arr1[0])):
                num += arr1[idx1][idx3] * arr2[idx3][idx2]
            row.append(num)
        answer.append(row)
                
    return answer

def solution(s):
    answer = []
    s_sp = s.split()
    s_list = list(map(int, s_sp))
    
    s_answer = sorted(s_list)
    answer.append(str(s_answer[0]))
    answer.append(str(s_answer[-1]))
    
    return " ".join(answer)

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

def solution(num):
    answer = 0
    
    while True:
        if num == 1:
            break
            
        if num%2 == 0:
            num = num / 2
            answer += 1
        else:
            num = num * 3 + 1
            answer += 1
        
        if answer >= 500:
            return -1
        
    return answer