Beautiful Year

最新推荐文章于 2020-12-11 20:03:34 发布

JimmyLegend

最新推荐文章于 2020-12-11 20:03:34 发布

阅读量898

点赞数

分类专栏：练习

本文链接：https://blog.csdn.net/guoqingshuang/article/details/52572398

版权

练习专栏收录该内容

389 篇文章 2 订阅

订阅专栏

Beautiful Year

Time Limit: 1000MS Memory Limit: 65536KB

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.
Given a year number, find the minimum year number which is strictly larger than the given one and has only distinct digits.

Input

There are multiple test cases.
Each test case contains a single line contains integer y (1000 ≤ y ≤ 9000) — the year number.

Output

For each test case:
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

1987
2013

Example Output

2013
2014

Hint

Author

qinchuan

#include<stdio.h>
int main()
{
    int n,m,k,i,j,a,b,c,d;
    while(scanf("%d",&n)!=EOF)
        {
            for(i=n+1;;i++)
            {
              a=i%10;
              b=(i/10)%10;
              c=(i/100)%10;
              d=(i/1000)%10;
              if(a!=b&&a!=c&&a!=d&&b!=c&&b!=d&&c!=d)
              {
                  printf("%d\n",i);
                  break;
              }
            }

        }
}