from itertools import combinations
CL=['0','1','2','3','4','5','6','7','8','9']
n=int(input())
ss=[]
for i in range(1,11):
a=list(combinations(CL,i))
for i in a:
k=sorted(list(i),reverse=True)
ss.append(int(''.join(k)))
ss.sort()
if n<1023:
print(ss[n])
else:
print(-1)
'알고리즘 > 백준' 카테고리의 다른 글
백준-1085번(직사각형에서 탈출)-python3 (0) | 2023.11.23 |
---|---|
백준-1065번(한수)-python3 (0) | 2023.11.23 |
백준-1012번(유기농 배추)-python3 (0) | 2023.11.23 |
백준-1011번(Fly me to the Alpha Centauri )-python3 (0) | 2023.11.23 |
백준-1008(A/B)-python (0) | 2023.11.23 |