Problem C. Ones
Input ¯le: ones.in
Time limit: 5 seconds
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?
Input
Process n on each line, until a negative number ¡1 is read.
Output
Output the solutions on separate lin
Input ¯le: ones.in
Time limit: 5 seconds
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?
Input
Process n on each line, until a negative number ¡1 is read.
Output
Output the solutions on separate lin
