Beautiful Year

http://codeforces.com/problemset/problem/271/A

Beautiful Year

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

It seems like the year of 2013 came only yesterday. Do you know a curious fact? The year of 2013 is the first year after the old 1987 with only distinct digits.

Now you are suggested to solve the following problem: given a year number, find the minimum year number which is strictly larger than the given one and has only distinct digits.

Input

The single line contains integer y (1000 ≤ y ≤ 9000) — the year number.

Output

Print a single integer — the minimum year number that is strictly larger than y and all it's digits are distinct. It is guaranteed that the answer exists.

Sample test(s)

input

1987

output

2013

input

2013

output

2014

这题算水题把。

题意：给你一个数，然后求比这个数大但是各个位上面的数不同的最小数（有点拗口啊。）

AC代码：

#include<iostream>
#include<cstdio>

using namespace std;

int main()
{
    int y,i,a,b,c,d;
    while(scanf("%d",&y)!=EOF)
    {
        for(i = y+1; i < 10000; i++)
        {
            y = i;
            a = y%10;
            y = y/10;
            b = y%10;
            y = y/10;
            c = y%10;
            d = y/10;
            if(a!=b && a!=c && a!=d)
            {
                if(b!=c && b!=d)
                {
                    if(c!=d)
                    {
                        printf("%d\n",i);
                        break;
                    }
                }
            }
        }
    }

    return 0;
}