Submission #1866354

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

int main() {
	int n, k;
	cin >> n >> k;
	vector<int> v;
	while (n) {
		v.push_back(n % 10);
		n /= 10;
	}
	v.push_back(0);
	reverse(v.begin(), v.end());
	bool d[10];
	for (int i = 0; i < 10; i++) d[i] = true;
	for (int i = 0; i < k; i++) {
		int a;
		cin >> a;
		d[a] = false;
	}
	int m = 10;
	int M = 10;
	for (int i = 0; i < 10; i++) {
		if (d[i] && m == 10) {
			m = i;
		}
		if (d[i] && i > 0) {
			M = i;
			break;
		}
	}
	for (int i = 1; i < v.size(); i++) {
		int a = v[i];
		if (d[a]) continue;
		for (int j = a; j < a + 10; j++) {
			if (d[j % 10]) {
				int b = j % 10;
				v[i] = b;
				if (b < a) {
					v[i - 1] = M;
				}
				break;
			}
		}
		for (int j = i + 1; j < v.size(); j++) v[j] = m;
		break;
	}
	if (v[0]) cout << v[0];
	for (int i = 1; i < v.size(); i++) {
		cout << v[i];
	}
	cout << endl;
}

Submission Info

Judge Result