Algorithm/boj

[파이썬] 1038 감소하는 수

takeU 2022. 6. 8. 12:45
반응형
from itertools import combinations

n = int(input())
li = []
for i in range(1, 11):
    for com in combinations(range(10), i):
        com = sorted(list(com), reverse=True)
        li.append(int("".join(map(str, com))))
li.sort()

print(li[n] if len(li) > n else -1)

완탐