[UVA] 10127 - Ones
Problem E - Ones
Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple
of n is a number which in decimal notation is a sequence of 1's. How
many digits are in the smallest such a multiple of n?
Sample input
3
7
9901
Output for sample inp...
