1
class Solution {
2
  public int minimumNumbers(int num, int k) {
3
    if (num == 0) return 0;
4
    if (k == 0)
5
      if (num % 10 == 0) // E.g. 20,1590,3000
6
      return 1;
7
      else return -1;
8
    for (int i = 1;
9
        i <= num / k;
10
        i++) // Start with set size 1 and look for set having unit's digit equal to that of num
11
    if (num % 10 == ((i * k) % 10)) // Look for equal unit's digit
12
      return i;
13

14
    return -1;
15
  }
16
}