KTH

Courses/ DD2458/ popup14/ popup14 hemtal v12/ Problems/ Ones
Log in
Hide

Problem H
Ones

\includegraphics{two_small}

Given any integer 1≤n≤100000 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? There are at most 1000 test cases.

\includegraphics{one_small}
 

\includegraphics{three_small}

  
Sample Input 1 Sample Output 1 
3
7
9901

3
6
12
Hide

Please log in to submit a solution to this problem

Log in