#F. Distinct Digits

    Type: RemoteJudge 1000ms 256MiB

Distinct Digits

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Distinct Digits

题面翻译

你有两个正整数 l l r r 1lr1051\leq l\leq r\leq 10^5),请你找出一个满足下列两个条件的正整数 xx :

  • lxr.l\leq x\leq r.
  • xx这个数的各个数位上的数值均不相同

假如有多个满足条件的解 xx ,输出任意一个均可。如果没有满足条件的解,那么输出1-1

题目描述

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

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

If there are multiple answers, print any of them.

输入格式

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

输出格式

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

样例 #1

样例输入 #1

121 130

样例输出 #1

123

样例 #2

样例输入 #2

98766 100000

样例输出 #2

-1

提示

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

In the second example, there is no valid answer.

20230211排序随堂测验

Not Attended
Status
Done
Rule
Ledo
Problem
7
Start at
2023-2-11 10:30
End at
2023-2-15 14:30
Duration
100 hour(s)
Host
Partic.
32