A14061. Unique Number
编程题
普及/提高-
知识点
题目描述
You are given a positive number $x$ . Find the smallest positive integer number that has the sum of digits equal to $x$ and all digits are distinct (unique).
输入格式
The first line contains a single positive integer $t$ ( $1 \le t \le 50$ ) — the number of test cases in the test. Then $t$ test cases follow.
Each test case consists of a single integer number $x$ ( $1 \le x \le 50$ ).
Each test case consists of a single integer number $x$ ( $1 \le x \le 50$ ).
输出格式
Output $t$ answers to the test cases:
- if a positive integer number with the sum of digits equal to $x$ and all digits are different exists, print the smallest such number;
- otherwise print -1.
- if a positive integer number with the sum of digits equal to $x$ and all digits are different exists, print the smallest such number;
- otherwise print -1.
输入输出样例
输入 #1
4 1 5 15 50
输出 #1
1 5 69 -1