[Codetree] 1차원 윷놀이 Python

https://www.codetree.ai/missions/2/problems/yutnori-1d/description

코드트리 | 코딩테스트 준비를 위한 알고리즘 정석

 

import sys
import copy


# 턴 수, 윷놀이 판 수, 말 개수
n, m, k = map(int, input().split(" "))

move = list(map(int, input().rstrip().split(" ")))
horse = [i for i in range(1, k+1)]

answer = []

cnt = 0

def get_point(answer):

    position = [1 for _ in range(k)] # -> 1, 2, 3번말
    for i in range(n):
        position[answer[i]-1] += move[i]

    cnt = 0
    for p in position:
        if p >= m:
            cnt += 1

    return cnt


def backtrack(dep):
    global cnt

    if dep == n:
        cnt = max(cnt, get_point(answer))
        return

    for i in range(k):
        answer.append(horse[i])
        backtrack(dep+1)
        answer.pop()
    

backtrack(0)

print(cnt)