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>
int main(){
  int k,min=50,i;
  scanf("%d",&k);
  for(i=2;i<100000;i++){
    long long n=k;
    int count=0;
    n*=i;
    while(n!=0){
      count+=n%10;
      n/=10;
    }
    if(min>count)
      min=count;
  }
  printf("%d\n",min);
  return 0;
}