CodeForces - 271A

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.
Examples

Input

1987

Output

2013

Input

2013

Output

2014
题目简述： 给定一个年份，找出在此年份之后最近的年份上的数字都不相同的年份（如1987）
题目思路： 将年份的数字拆成单个，比较数字是否有相同的。
AC代码如下：

#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
int n;
scanf_s("%d", &n);
int a, b, c, d;
for (int i = n + 1; i < 10000; i++)
{
a = i / 1000;
b = i / 100 % 10;
c = i / 10 % 10;
d = i % 10;
if (a != b && a != c && a != d && b != c && b != d && c != d)
{
printf("%d", i);
break;
}
}
return 0;
}

最后

以上就是热情大炮为你收集整理的CodeForces - 271A的全部内容，希望文章能够帮你解决CodeForces - 271A所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。