Yet Another Multiple Problem（同余方程+BFS）

SP12810

There are tons of problems about integer multiples. Despite the fact that the topic is not original, the content is highly challenging. That’s why we call it “Yet Another Multiple Problem”.
In this problem, you’re asked to solve the following question: Given a positive integer n and m decimal digits, what is the minimal positive multiple of n whose decimal notation does not contain any of the given digits?
Input
There are several test cases.
For each test case, there are two lines. The first line contains two integers n and m (1 ≤ n ≤ 10
4). The second line contains m decimal digits separated by spaces.
Input is terminated by EOF.
Output
For each test case, output one line “Case X: Y” where X is the test case number (starting from 1) while Y is the minimal multiple satisfying the above-mentioned conditions or “-1” (without quotation marks) in case there does not exist such a multiple.
Sample Input
2345 3
7 8 9
100 1
0
Sample Output
Case 1: 2345
Case 2: -1

将合法的数位保存下来，然后将合法的数为拼接起来，判断是否是$n$的倍数。
采用$BFS$能保证搜索的数字是递增的，保证第一个找到的是最优解。
设两个数$A,B$，若$A\equiv B(\mathrm{m}\mathrm{o}\mathrm{d}n)$那么将数位$C$拼接到$A,B$后面，有$AC\equiv BC(\mathrm{m}\mathrm{o}\mathrm{d}n)$，简单的证明如下：

因为：
$$\begin{gathered} AC\mathrm{m}\mathrm{o}\mathrm{d}n \\ =(10\ast A+C)\mathrm{m}\mathrm{o}\mathrm{d}n \\ =(10\ast A\mathrm{m}\mathrm{o}\mathrm{d}b+C\mathrm{m}\mathrm{o}\mathrm{d}n)\mathrm{m}\mathrm{o}\mathrm{d}n \\ =((10\mathrm{m}\mathrm{o}\mathrm{d}n)(A\mathrm{m}\mathrm{o}\mathrm{d}n)\mathrm{m}\mathrm{o}\mathrm{d}n+C\mathrm{m}\mathrm{o}\mathrm{d}n)\mathrm{m}\mathrm{o}\mathrm{d}n \end{gathered}$$同理：
$$\begin{gathered} BC\mathrm{m}\mathrm{o}\mathrm{d}n \\ =((10\mathrm{m}\mathrm{o}\mathrm{d}n)(B\mathrm{m}\mathrm{o}\mathrm{d}n)\mathrm{m}\mathrm{o}\mathrm{d}n+C\mathrm{m}\mathrm{o}\mathrm{d}n)\mathrm{m}\mathrm{o}\mathrm{d}n \end{gathered}$$
由$A\equiv B(\mathrm{m}\mathrm{o}\mathrm{d}n)$，得：$AC\equiv BC(\mathrm{m}\mathrm{o}\mathrm{d}n)$。
证毕。

因此如果有$A<B$且$A\equiv B(\mathrm{m}\mathrm{o}\mathrm{d}n)$，那么$B$就不用搜了，因为$B$在拼接后的所有结果在模$n$的结果都被$A$搜索过了，因此可以做一个剪枝。

由于模$n$的每一个结果都只搜索一次，事件复杂度为$O(n)$。

数为拼接后模数的更新：
$$AC\mathrm{m}\mathrm{o}\mathrm{d}n=(10\ast A+C)\mathrm{m}\mathrm{o}\mathrm{d}n$$

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstring>
#include <queue>
#include <string>
using namespace std;

int n, m;
vector<int> Digits;
bool Vis[10005];

struct Node {
	int mod;
	string Number;
};

inline bool Input() {

	memset(Vis, false, sizeof(Vis));
	Digits.clear();

	bool No[10];
	memset(No, false, sizeof(No));
	if (scanf("%d%d", &n, &m) == EOF) {
		return false;
	}
	while (m--) {
		int x;
		scanf("%d", &x);
		No[x] = true;
	}
	for (int i = 0; i < 10; ++i) {
		if (No[i] == false) {
			Digits.push_back(i);
		}
	}
	return true;
}

void BFS() {
	queue<Node>Q;
	for (int i = 0; i < Digits.size(); ++i) {
		const int& digit = Digits[i];
		if (digit == 0) {
			continue;
		}
		Node node;
		node.mod = digit % n;
		node.Number = digit + '0';

		if (!node.mod) {
			cout << node.Number << endl;
			return;
		}
		Q.push(node);
	}

	while (!Q.empty()) {
		Node CurNode = Q.front();
		Q.pop();
		for (int i = 0; i < Digits.size(); ++i) {
			const int& digit = Digits[i];
			Node NewNode;
			string a;
			a = digit + '0';

			NewNode.Number = CurNode.Number + a;
			NewNode.mod = (CurNode.mod * 10 + digit) % n;
			if (!NewNode.mod) {
				cout << NewNode.Number << endl;
				return;
			}
			else if (Vis[NewNode.mod] == false) {
				Q.push(NewNode);
				Vis[NewNode.mod] = true;
			}
		}
	}
	cout << "-1" << endl;
	return;
}

int main() {
	int Case = 0;
	while (Input()) {

		cout << string("Case ") << ++Case << string(": ");
		BFS();
	}

	return 0;

}