Preparando MOJI

Distinct Digits

1000ms 262144K

Description:

You have two integers $$$l$$$ and $$$r$$$. Find an integer $$$x$$$ which satisfies the conditions below:

  • $$$l \le x \le r$$$.
  • All digits of $$$x$$$ are different.

If there are multiple answers, print any of them.

Input:

The first line contains two integers $$$l$$$ and $$$r$$$ ($$$1 \le l \le r \le 10^{5}$$$).

Output:

If an answer exists, print any of them. Otherwise, print $$$-1$$$.

Sample Input:

121 130

Sample Output:

123

Sample Input:

98766 100000

Sample Output:

-1

Note:

In the first example, $$$123$$$ is one of the possible answers. However, $$$121$$$ can't be the answer, because there are multiple $$$1$$$s on different digits.

In the second example, there is no valid answer.

Informação

Codeforces

Provedor Codeforces

Código CF1228A

Tags

brute forceimplementation

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:52:34

Relacionados

Nada ainda