1033: positive multipleTime Limit: 1000 MS Memory Limit: 65536 KB
Total Submit: 103 Accepted: 25 Page View: 819
Submit Status Discuss
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 file 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.
22 3 7 0 1 2 1 1