Submission #3767634

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e5 + 5);
const double EPS = 1e-10;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define ALL(v) (v).begin(), (v).end()

int main() {
    int n, k, ans;
    bool ok[10];
    cin >> n >> k;
    REP(i,10)ok[i] = true;
    REP(i,k){
        int d;
        cin >> d;
        ok[d] = false;
    }
    ans = n;
    while(1){
        bool f = true;
        int tmp = ans;
        while(tmp>0){
            f &= ok[tmp%10];
            tmp /=10;
        }
        if(f){
            cout << ans << endl;
            break;
        }
        else{
            ans++;
        }
    }
    return 0;
}

Submission Info

Judge Result