Problem description
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
解题思路：题目的意思就是输入一个4位数的数字y，输出比它大的最小正数（y的各位数字都不相同），简单暴力水过！
AC代码：
1 #include<bits/stdc++.h> 2 using namespace std; 3 int main(){ 4 int y; 5 cin>>y; 6 for(int i=y+1;;++i){ 7 int a=i%10,b=i/10%10,c=i/100%10,d=i/1000; 8 if(a!=b && a!=c && a!=d && b!=c && b!=d && c!=d){cout<<i<<endl;break;} 9 } 10 return 0; 11 }