[UVA][bfs] 1341 - Different Digits
Given a positive integer n, your task is to find a positive integer m, which is a multiple of n, and
that m contains the least number of different digits when represented in decimal. For example,
number 1334 contains three different digits 1, 3 and 4.
Input
...
