PAT 天梯赛 L1-033. 出生年 【水】

题目链接

https://www.patest.cn/contests/gplt/L1-033

AC代码

#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <map>
#include <stack>
#include <set>
#include <numeric>
#include <sstream>

using namespace std;
typedef long long LL;

const double PI = 3.14159265358979323846264338327;
const double E = 2.718281828459;
const double eps = 1e-6;

const int MAXN = 0x3f3f3f3f;
const int MINN = 0xc0c0c0c0;
const int maxn = 1e5 + 5;
const int MOD = 1e9 + 7;

int f(int y)
{
    map <int, int> m;
    m.clear();
    if (y < 1000)
        m[0] = 1;
    while (y)
    {
        m[y % 10] = 1;
        y /= 10;
    }
    return m.size();
}

int main()
{
    int y, n;
    cin >> y >> n;
    int ans = 0;
    while (1)
    {
        if (f(y) == n)
            break;
        y++;
        ans++;
    }
    printf("%d %04d\n", ans, y);
}