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.
问题分析:输入一个年份,输出一个大于其的年份,且每一位数都不相等。
AC代码:
#include<iostream>
using namespace std;
int main()
{
int n,j=0;
cin >> n;
for(int i=1;;i++)
{
int a, b, c, d;
a = (n + i) / 1000;
b = ((n + i) / 100) % 10;
c =((n + i) / 10) % 10;
d = (n + i) % 10;
if (a != b && c != d && a != c && a != d && b != d && b != c)
{
j++;
cout << n + i;
}
if (j == 1)break;
}
}