[35일차][프로그래머스][2018 KAKAO BLIND RECRUITMENT][17681]1차 비밀지도

def solution(n, arr1, arr2):
    result = []
    for idx in range(n):
        arr1_coordinate = bin(arr1[idx]).split("0b")[1].zfill(n)
        arr2_coordinate = bin(arr2[idx]).split("0b")[1].zfill(n)
        
        merge_coordinate = "";
        for idx1 in range(n):
            if arr1_coordinate[idx1] == '1' or arr2_coordinate[idx1] == '1':
                merge_coordinate += '#'
            else:
                merge_coordinate += ' '
        
        result.append(merge_coordinate)
        
    return result