PS - 비밀지도 - 2018 KAKAO BLIND RECRUITMENT

ps1-secret-map.py

# Python3

def solution(n, arr1, arr2):
    answer = []

    for idx in range(n):
        result_arr = arr1[idx] | arr2[idx]

        # answer.append(bin(result_arr)[2:].zfill(n).replace('1', '#').replace('0', ' '))
        answer.append(format(result_arr, 'b').zfill(n).replace('1', '#').replace('0', ' '))

    return answer

# test
# print(solution(5, [9, 20, 28, 18, 11], [30, 1, 21, 17, 28]))
print(solution(6, [46, 33, 33 ,22, 31, 50], [27 ,56, 19, 14, 14, 10]))

숫자를 2진수 문제열로 바꾸는 두가지 방법

print(bin(5)[2:])
print(format(5, 'b'))