[Python] SWEA D3 : 1244 - [S/W 문제해결 응용] 2일차 - 최대 상금

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AV15Khn6AN0CFAYD&categoryId=AV15Khn6AN0CFAYD&categoryType=CODE&problemTitle=&orderBy=RECOMMEND_COUNT&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=1

SW Expert Academy

---

📌 작성한 풀이 

def dfs(numbers,cnt):
    global result

    temp = "".join(numbers)
    if int(temp) in result[cnt]: return
    else: result[cnt].append(int(temp))

    if cnt == 0: return

    n = len(numbers)

    for i in range(n-1):
        for j in range(i+1,n):
            numbers[i],numbers[j] = numbers[j],numbers[i]
            dfs(numbers, cnt -1)
            numbers[j],numbers[i] = numbers[i],numbers[j]


t = int(input())
for tc in range(1,1+t):
    nums, count = input().split()
    nums = list(nums)
    result = [[] for _ in range(int(count)+1)]

    dfs(nums,int(count))
    print(f'#{tc} {max(result[0])}')

 

 

참고) 

https://hyunse0.tistory.com/321