Beautiful Year(cf)

最新推荐文章于 2022-01-21 16:31:08 发布

SZTLLDGZ

最新推荐文章于 2022-01-21 16:31:08 发布

阅读量473

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM-EXERCISE

本文链接：https://blog.youkuaiyun.com/nuc_Sheryl/article/details/50986725

ACM-EXERCISE 专栏收录该内容

58 篇文章

订阅专栏

本文介绍了一个算法问题，即在给定的年份基础上找到下一个所有数字都唯一的年份。通过读取输入年份并逐步递增，直到找到满足条件的年份为止。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

F - Beautiful Year

Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 271A

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.

Sample Input

Input

Output

Input

Output

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

int main()
{
    int i, y, yn[4], c, d, a[10] = {0};
    scanf("%d", &y);
    c = y;
    c++;
    while(1)
    {
        d = c;
        for( i=0; i<4; i++ )
        {
            yn[i] = d%10;
            if( !a[yn[i]] )
                a[yn[i]] = 1;
            else
                break;
            d = d/10;
        }
        if( 4 == i )
        {
            printf("%d\n", c);
            break;
        }
        memset(a, 0, sizeof(a));
        c++;

    }
    return 0;
}

签到大水题。。。