CodeForces - 271A

最新推荐文章于 2024-03-13 10:49:54 发布

weixin_44003830

最新推荐文章于 2024-03-13 10:49:54 发布

阅读量275

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/weixin_44003830/article/details/86586129

本文介绍了一种算法，用于找到给定年份后第一个所有数字都不同的年份。通过逐位检查年份的数字，确保没有重复，从而找出满足条件的最小年份。

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

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
题目简述：给定一个年份，找出在此年份之后最近的年份上的数字都不相同的年份（如1987）
题目思路：将年份的数字拆成单个，比较数字是否有相同的。
AC代码如下：

#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	int n;
	scanf_s("%d", &n);
	int a, b, c, d;
	for (int i = n + 1; i < 10000; i++)
	{
		a = i / 1000;
		b = i / 100 % 10;
		c = i / 10 % 10;
		d = i % 10;
		if (a != b && a != c && a != d && b != c && b != d && c != d)
		{
			printf("%d", i);
			break;
		}
	}
	return 0;
}