01.17C

01.17C
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
问题链接:https://vjudge.net/contest/277768#problem/C
问题代码:

#include<iostream>
using namespace std;
int main()
{
	int a, b, c, d, e;
	cin >> a;
	a = a + 1;
	for (; a <=9000,a!=8976; a++)
	{

		b = a / 1000 % 10;
		c = a / 100 % 10;
		d = a / 10 % 10;
		e = a / 1 % 10;
		
		if(b!=c&&b!=d&&b!=e&&c!=d&&c!=e&&d!=e)
		{
			break;
		}
	}

	cout << a;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值