当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1465：Multiple

题目描述
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).
输入解释
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.
输出解释
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:
输入样例 
22
3
7
0
1

2
1
1
输出样例 
110
0
该题目是Virtual Judge题目，来自 北京大学POJ
题目来源 Southeastern Europe 2000
源链接： POJ-1465
最后修改于 2020-10-29T06:04:53+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
1000 32768