标签：between least blog each seve following hat 同余 pst
Description
a program that, given a natural number N between 0 and 4999 (inclusively), and M distinct decimal digits X1,X2..XM (at least one), finds the smallest strictly positive multiple of N that has no other digits besides X1,X2..XM (if such a multiple exists).
Input
The input has several data sets separated by an empty line, each data set having the following format:
On the first line - the number N
On the second line - the number M
On the following M lines - the digits X1,X2..XM.
Output
For each data set, the program should write to standard output on a single line the multiple, if such a multiple exists, and 0 otherwise.
An example of input and output:
Sample Input
22
3
7
0
1
2
1
1
Sample Output
110
0
https://blog.csdn.net/u013480600/article/details/26458435
Multiple(BFS+同余剪枝)
标签：between least blog each seve following hat 同余 pst
原文地址：https://www.cnblogs.com/wkfvawl/p/9557489.html
