In problem small multiple , you are asked to the smallest possible sum of the digits in the decimal notation of a positive multiple of K.
what i did was i ran a loop from 1 to 70000000 and compute answer for each i. It gave WA in some test cases. 16/66 MY solL:
The editorial mentions Construct a graph with K vertices, start from 1 and answer will be minimum distance from 1 to 0 , +1.
Though i understood the editorial, But i couldn't get the proof behind it. why it will give right answer. Why we are creating only k vertices and considering each number as x % k.
Can anyone who solved it, explain the logic behind it. Or any other approach for solving this problem.