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 (void){
 int n=0;
 int k=0;
 int c=0;
 int s,ss,sk;
 scanf("%d",&n);
 sk=n*2;
 while(sk){
  k+=sk%10;
  sk/=10;
 }
 sk=2;
 while(k>=c){
  sk++;
  s=n*sk;
  ss=0;
  c=0;
  while(s){
    ss+=s%10;
    s/=10;
    c++;
  }
  if(k>ss){
   k=ss;
  }
 }
 printf("%d\n",k);
 return 0;
}