프로그래머스 - 카펫[42842]

https://programmers.co.kr/learn/courses/30/lessons/42842

코딩테스트 연습 - 카펫

def solution(brown, yellow):

    answer = []

    n = brown + yellow

    li = []

 

    for i in range(3,n+1):

        if n % i == 0:

            a = i

            b = n//i

            if a <= b:

                li.append([b,a])

            else:

                break

    if len(li) == 1:

        return li[0]

    else:

        for i in li:

            if yellow == (i[0] * 2) + ((i[1]-2) * 2):

                return i

 

-----------------

 

def solution(brown, yellow):
    for v in range(1, yellow+1):
        if yellow % v == 0:
            l = yellow // v
            if l >= v:
                if (v+2)*(l+2) - yellow == brown:
                    return [l+2, v+2]
print(solution(24,24))