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 (Clang 3.8.0) (judge verdict: Wrong Answer)

#include <iostream>

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
   long int t,n,y,sum=0,p=0,mnsum=100000000;
    cin>>n;
     for(int i=2;i<10000001;i++)
    {
        y=n*i;
        sum=0;
        while(y)
        {
            p=y%10;
            sum+=p;
            y=y/10;
        }

        if(sum<mnsum)
        {
            mnsum=sum;
        }
    }
    cout<<mnsum;
    return 0;
}