2310. The number of bits is the sum of integers of K

Reference resources ：

https://leetcode.cn/problems/sum-of-numbers-with-units-digit-k/solution/ge-wei-shu-zi-wei-k-de-zheng-shu-zhi-he-c8nlx/

class Solution {
public:
    int minimumNumbers(int num, int k) {
      //  The sum of empty multisets is  0 
      if(num == 0){
        return 0;
      }    
      
      //  Refer to the official explanation 
      for(int i = 1; i <= 10; i++){
        if(i * k <= num && (num - (i * k)) % 10 == 0){
          return i;
        }
      }
      
      return -1;
    }
};