codeforces 271A Beautiful Year（暴力水题)

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

defense881

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

阅读量2k

点赞数

分类专栏： codeforces 文章标签： codeforces 水题

本文链接：https://blog.csdn.net/u012860428/article/details/28638717

版权

codeforces 专栏收录该内容

33 篇文章 0 订阅

订阅专栏

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

Output

Input

Output

2014

╮(╯▽╰)╭ 被y<=9000,坑了，我这水平不能再水了，加油！！！
代码：
#include <iostream>
using namespace std;
bool check(int n)
{
    int i=0,a[4],j;
    while(n)
    {
        a[i++]=n%10;
        n/=10;
        //cout<<a[i-1]<<endl;
    }
    for(i=0;i<4;i++)
    {
        for(j=i+1;j<4;j++)
        {
            if((a[i]==a[j]))
                return false;
        }
    }
    return true;
}
int main()
{
    int i,n;
    while(cin>>n)
    {
        for(i=n+1;;i++)
        {
            if(check(i))
            {
                cout<<i<<endl;
                break;
            }
        }
    }
    return 0;
}