Submission #3411599

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <map>
#include <stack>
#include <string>
#include <list>
#include <math.h>
using namespace std;

typedef pair<int, int> P;
#define ll long long


int N, K;
vector<int> d;
bool check(int n){
	while (n > 0){
		if (find(d.begin(), d.end(), n % 10) != d.end()) return false;
		n /= 10;
	}
	return true;
}

int main(){

	cin >> N >> K;
	for (int i = 0; i < K; i++){
		int tmp;
		cin >> tmp;
		d.push_back(tmp);
	}

	for (int n = N;; n++){
		if (check(n)){
			cout << n << endl;
			return 0;
		}
	}

	return 0;
}

Submission Info

Judge Result