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 K;
    int min = 0;
    int data = 0;
    int dig = 0;
    int sum = 0;
    scanf("%d", &K);
    for(int i = 0; K < 100000; i++){
        data = K;
        while(data){
            dig = data % 10;
            sum = sum + dig;
            data = data / 10;
        }
        if(i == 0)
            min = sum;
        if(sum < min)
            min = sum;

        K += K;;
    }
    printf("%d\n", min);

    return 0;
}