A. Beautiful Year

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
题解:4个不相同的数
code:
#include <iostream>
using namespace std;
int main()
{
     int y,i;
     while(cin>>y)
     {
         int a,b,c,d;
           for(i=y+1;;i++)
           {
               a=i%10;
               b=(i/10)%10;
               c=(i/100)%10;
               d=(i/1000)%10;
               if(a!=b && b!=c&& c!=d && a!=c && a!=d && b!=d)
               {
                   cout<<i<<endl;
                   break;
               }

           }
     }
     return 0;
}


 
    
 
   

你可能感兴趣的:(A. Beautiful Year)