1240. [S/W 문제해결 응용] 1일차 - 단순 2진 암호코드
import copy t = int(input()) code = ['0001101','0011001','0010011','0111101','0100011','0110001','0101111','0111011','0110111','0001011'] for q in range(t): n,m = map(int,input().split()) arr = [] ans = '' for i in range(n): # 배열 입력 arr.append(input()) for i in range(0,n): # 1 찾기 if arr[i].find('1') >= 0: found_arr = copy.deepcopy(arr[i]) break; for i in range(m-1,0,-1): #뒤에서 부터 1찾기 if found_arr..
2019. 9. 28.