Brute Force12 [python] 1018. 체스판 다시 칠하기 문제 출처 1018. 체스판 다시 칠하기.md 풀이 N, M = map(int, input().split()) board = [input() for _ in range(N)] w, b = 'WBWBWBWB', 'BWBWBWBW' white = [w, b] * 4 black = [b, w] * 4 min_ = 64 for y in range(N-7): for x in range(M-7): cnt = 0 for i in range(8): for j in range(8): if board[y+i][x+j] != white[i][j]: cnt += 1 if cnt > min_: break min_ = min(min_, cnt) cnt = 0 for i in range(8): for j in range(8): i.. 2019. 9. 27. [python] 7568. 덩치 문제출처 7568. 덩치 풀이 N = int(input()) people = [list(map(int, input().split())) for i in range(N)] result = [0]*N for i in range(N): rank = 1 for j in range(N): if people[j][0] > people[i][0] and people[j][1] > people[i][1]: rank += 1 result[i] = rank print(' '.join([str(i) for i in result])) 2019. 9. 27. [python] 숫자 야구 문제 출처 숫자 야구 풀이 def check(x, y): s, b = 0, 0 for i in range(3): if y[i] == x[i]: s += 1 continue if y[i] in x: b += 1 return (s, b) def solution(baseball): answer = 0 for ball in baseball: ball[0] = str(ball[0]) nums = [] for i in range(100, 1000): num = str(i) if len(set(num)) == 3 and '0' not in num: nums.append(num) for x in nums: for ball in baseball: s, b = check(x, ball[0]) if s != ball[1] .. 2019. 8. 30. [python] 카펫 문제 출처 카펫 풀이 def solution(brown, red): for i in range(1, int(red**0.5)+1): if red % i == 0: if (i*2) + ((red // i)*2) == brown-4: return [red//i+2, i+2] 2019. 8. 30. 이전 1 2 3 다음
