思路题 A. Distinct Digits

题目链接：http://codeforces.com/problemset/problem/1228/A

You have two integers l and r. Find an integer x

which satisfies the conditions below:

l≤x≤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≤l≤r≤105

).

Output

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

.

Examples
Input

121 130

Output

123

Input

98766 100000

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.

题目大意：

给出一个数x l≤x≤r 要求每一位都不一样 输出即可
思路：暴力出所有情况

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int main()
{
    int l,r,k,m,n;
    cin>>l>>r;
    for(int i=l; i<=r; i++)//暴力遍历所有情况
    {
        int a[10]= {0};
        m=0;
        k=i;
        while(k>0)
        {
            a[k%10]++;
            if(a[k%10]>1)
            {
                m=1;
                break;
            }
            k/=10;
        }
        if(m==0)
        {
            cout<<i;
            break;
        }
    }
    if(m==1)
    {
        cout<<"-1";
    }
    return 0;
}