CodeForces 271A - Beautiful Year

89 阅读 0 评论 59 点赞

我是靠谱客的博主耍酷银耳汤，这篇文章主要介绍CodeForces 271A - Beautiful Year，现在分享给大家，希望可以做个参考。

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.

Example

Input

复制代码

1
2
1987

Output

复制代码

1
2
2013

Input

复制代码

1
2
2013

Output

复制代码

1
2014

代码如下：

复制代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
#include<stdio.h>
int main()
{
int a[4], n, i;
scanf("%d", &n);
for (i = n+1; i <9001 ; i++)
{
a[0] = i / 1000;
a[1] = i / 100 % 10;
a[2] = i / 10 % 10;
a[3] = i % 10;
if (a[0] != a[1] && a[0] != a[2] && a[0] != a[3] && a[1] != a[2] && a[1] != a[3] && a[2] != a[3])
{
printf("%dn", i);
break;
}
}
return 0;
}