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 C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include "stdio.h"
#define N 100000
int main() {
  int n, i, min;
  int a, b, c, d, e, f, t;
  scanf("%d", &n);
  for (i = 1; n * i <= N; i++) {
    t =  n * i;
    a = t / 100000;
    b = (t % 100000) / 10000;
    c = (t % 10000) / 1000;
    d = (t % 1000) / 100;
    e = (t % 100) / 10;
    f = t % 10;
    if (a + b + c + d + e + f < min) min = a + b + c + d + e + f;
  }
  printf("%d\n", min);
  return 0;
}