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 Java7 (OpenJDK 1.7.0) (judge verdict: Wrong Answer)

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String in1 = sc.nextLine().trim();
		long n = Long.parseLong(in1);
		long min = calc(n * 2);

		for (int i = 3 ; i <= 100000; i++) {
			long temp = calc(n * i);
			if (min >= temp ){
				min = temp;
			}
		}
		System.out.println(min);

	}

	private static long calc(long n) {
		String str = Long.toString(n);
		char[] inArray = str.toCharArray();
		long len = str.length();
		long ans = 0;
		for (int i = 0; i < len ;i++) {
			ans = ans + Long.parseLong(Character.toString(inArray[i]));
		}
		return ans;

	}
}