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

#include<iostream>
#include<algorithm>

using namespace std;
int main()
{
    long long k;
    cin>>k;
    long long mi=1e10;
    for(long long x = 1; x<1e6*7;x++){
        long long m = k*x;
        long long th = 0;
        while(m){
            th += m%10;
            m/=10;
        }
        mi=min(mi,th);
    }
    cout<<mi<<endl;
    
    return 0;
}