문제1473--Repeatless Numbers

1473: Repeatless Numbers

실행시간 제한: 1 Sec  메모리사용 제한: 64 MB
제출: 155  통과: 48
[제출] [채점기록] [묻고답하기]

문제 설명

A repeatless number is a positive integer containing no repeated digits. For instance, the first 25 repeatless numbers are

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, …

Given an integer n, your goal is to compute the nth repeatless number.

입력 설명

The input test file will contain multiple test cases, each consisting of a single line containing the integer n, where 1 ≤ n ≤ 1000000. The end-of-file is marked by a test case with n = 0 and should not be processed.

출력 설명

For each input case, the program should print the nth repeatless number on a single line.

입력 예시 Copy

25
10000
0

출력 예시 Copy

27
26057

출처/분류