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;
    long long int x = 0;
    long long int tx = 0;
    scanf("%d", &k);
    int kb=k, keta=0;
    while(k){
        x+=k%10;
        k/=10;
        keta++;
    }
    //printf("%lld  %d\n", x, keta);
    tx = x;
    for (int i = 1; i<=x; i++){
        tx=0;
        k=kb*i;
        while(k){
            tx+=k%10;
            k/=10;
        }
        x = x>tx?tx:x;
    }
    printf("%lld\n", x);
    return 0;
}