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.Scanner;

public class Main {

	public static void main(String[] args) {
		try (Scanner sc = new Scanner(System.in)) {
			int k = sc.nextInt();
			int result = Integer.MAX_VALUE;

			for (long i = 2; i <= 300000; i++) {
				int tmp = calc(i * k);
				if (tmp < result) {
					result = tmp;
				}
			}

			System.out.println(result);
		}
	}

	private static int calc(long num) {
		int result = 0;

		for (;;) {
			result += num % 10;
			num /= 10;
			if (num <= 0) {
				return result;
			}
		}
	}
}