#2866. Problem E - Ones
Problem E - 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?


样例
输入
3
7
9901
输出
3
6
12