카펫

[ji-0630]

문제 설명

[ji-0630]

나의 풀이

import math
def solution(brown, yellow):
    po = []
    for i in range(1, int(math.sqrt(yellow))+1):
        if yellow % i == 0:
            po.append([yellow//i, i])

    for i in po:
        if brown == ((i[0]+2)*(i[1]+2)-yellow):
            return [i[0]+2, i[1]+2]