Smallest Integer Divisible by K
Given a positive integer k, find the length of the smallest positive integer n such that n is divisible by k, and n only contains the digit 1.
Return the length of n. If there is no such n, return -1.
Note: n may not fit in a 64-bit signed integer.
Example 1
Input
k = 1Output
1The smallest answer is n = 1, which has length 1.
Example 2
Input
k = 2Output
-1There is no such positive integer n divisible by 2.
Constraints
- 1 <= k <= 10^5