Problem:
Score : 700 points

Problem Statement

Find the smallest possible sum of the digits in the decimal notation of a positive multiple of K.

Constraints

2 \leq K \leq 10^5

K is an integer.

Input

Input is given from Standard Input in the following format:

K

Output

Print the smallest possible sum of the digits in the decimal notation of a positive multiple of K.

Sample Input 1

6

Sample Output 1

3

12=6×2 yields the smallest sum.

Sample Input 2

41

Sample Output 2

5

11111=41×271 yields the smallest sum.

Sample Input 3

79992

Sample Output 3

36

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;

class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        long K =sc.nextLong();
        final long nMax = 1000000;
        long ans = Long.MAX_VALUE;
        long i = 1L;
        while(i<=nMax){
            long j=i*K;
            long cur = 0;
            while(j>0){
                cur += j%10;
                j = j/10;
            }
            ans = Math.min(ans,cur);
            i++;
        }
        /*for(int i=1;i<=nMax;i++){
            long j = K*i;
            int cur = 0;
            while(j>0){
                cur += j%10;
                j = j/10;
            }
            ans = Math.min(ans,cur);
        }*/


        System.out.println(ans);
    }
}