Preparando MOJI

Unique Number

2000ms 262144K

Description:

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).

Input:

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$$$).

Output:

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.

Sample Input:

4
1
5
15
50

Sample Output:

1
5
69
-1

Informação

Codeforces

Provedor Codeforces

Código CF1462C

Tags

brute forcegreedymath

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 10:09:22

Relacionados

Nada ainda