Smallest multiple of N formed using the given set of digits - GeeksforGeeks

08 May, 2019
Given a set of digits S and an integer N, the task is to find the smallest positive integer if exists which contains only the digits from S and is a multiple of N. Note that the digits from the set can be used multiple times.
Examples:
Input: S[] = {5, 2, 3}, N = 12Output: 252We can observe that 252 is formed using {2, 5} and is a multiple of 12
Input: S[] = {1, 3, 5, 7, 9}, N = 2Output: -1Multiple of 2 would always be an even number but from the given set of digits even number can’t be formed.
A simple approach is to sort the set of digits and then move from smallest to the largest number formed using the given digits. We check each number whether it satisfies the given condition. Implementing it this way would result in exponential time complexity.
A better approach is to use Modular Arithmetic. So, we maintain a queue in which we will store the modulus of numbers formed using set of digits with the given number N. Initially in the queue, there would be (single digit number) % N but we can calculate (double digit number) % N by using,
New_mod = (Old_mod * 10 + digit) % N
By using the above expression we can calculate modulus values of multiple digit numbers. This is an application of dynamic programming as we are building our solution from smaller state to larger state. We maintain an another vector to ensure that element to be inserted in queue is already present in the queue or not. It uses hashing to ensure O(1) time complexity. We used another vector of pair which also uses hashing to store the values and its structure is
result[new_mod] = { current_element_of_queue, digit}
This vector would be used to construct the solution:
Sort the set of digits.Initialize two vectors dp and result, with INT_MAX and {-1, 0} respectively.Initialize a queue and insert digit % N.Do while queue is not empty.Remove front value from queue and for each digit in the set, find (formed number) % N using above written expression.If we didn’t get 0 as a modulus value before queue is empty then smallest positive number does not exist else trace the result vector from the 0th index until we get -1 at any index.Put all these values in another vector and reverse it.This is our required solution.
Sort the set of digits.
Initialize two vectors dp and result, with INT_MAX and {-1, 0} respectively.
Initialize a queue and insert digit % N.
Do while queue is not empty.
Remove front value from queue and for each digit in the set, find (formed number) % N using above written expression.
If we didn’t get 0 as a modulus value before queue is empty then smallest positive number does not exist else trace the result vector from the 0th index until we get -1 at any index.
Put all these values in another vector and reverse it.
This is our required solution.
Below is the implementation of the above approach:
C++
Python3
// C++ implementation of the approach#include <bits/stdc++.h>using namespace std;  // Function to return the required numberint findSmallestNumber(vector<int>& arr, int n){      // Initialize both vectors with their initial values    vector<int> dp(n, numeric_limits<int>::max() - 5);    vector<pair<int, int> > result(n, make_pair(-1, 0));      // Sort the vector of digits    sort(arr.begin(), arr.end());      // Initialize the queue    queue<int> q;    for (auto i : arr) {        if (i != 0) {              // If modulus value is not present            // in the queue            if (dp[i % n] > 1e9) {                  // Compute digits modulus given number and                // update the queue and vectors                q.push(i % n);                dp[i % n] = 1;                result[i % n] = { -1, i };            }        }    }      // While queue is not empty    while (!q.empty()) {          // Remove the first element of the queue        int u = q.front();        q.pop();        for (auto i : arr) {              // Compute new modulus values by using old queue            // values and each digit of the set            int v = (u * 10 + i) % n;              // If value is not present in the queue            if (dp[u] + 1 < dp[v]) {                dp[v] = dp[u] + 1;                q.push(v);                result[v] = { u, i };            }        }    }      // If required condition can't be satisfied    if (dp[0] > 1e9)        return -1;    else {          // Initialize new vector        vector<int> ans;        int u = 0;        while (u != -1) {              // Constructing the solution by backtracking            ans.push_back(result[u].second);            u = result[u].first;        }          // Reverse the vector        reverse(ans.begin(), ans.end());        for (auto i : ans) {              // Return the required number            return i;        }    }}  // Driver codeint main(){    vector<int> arr = { 5, 2, 3 };    int n = 12;      cout << findSmallestNumber(arr, n);      return 0;}
# Python3 implementation of the approach   # Function to return the required number def findSmallestNumber(arr, n):        # Initialize both vectors with their initial values     dp = [float('inf')] * n     result = [(-1, 0)] * n       # Sort the vector of digits     arr.sort()       # Initialize the queue     q = []     for i in arr:          if i != 0:                # If modulus value is not             # present in the queue             if dp[i % n] > 10 ** 9:                    # Compute digits modulus given number                 # and update the queue and vectors                 q.append(i % n)                 dp[i % n] = 1                 result[i % n] = -1, i                     # While queue is not empty     while len(q) > 0:          # Remove the first element of the queue         u = q.pop(0)         for i in arr:                # Compute new modulus values by using old             # queue values and each digit of the set             v = (u * 10 + i) % n               # If value is not present in the queue             if dp[u] + 1 < dp[v]:                  dp[v] = dp[u] + 1                 q.append(v)                 result[v] = u, i        # If required condition can't be satisfied     if dp[0] > 10 ** 9:        return -1     else:            # Initialize new vector         ans = []         u = 0         while u != -1:                # Constructing the solution by backtracking             ans.append(result[u][1])             u = result[u][0]                   # Reverse the vector         ans = ans[::-1]         for i in ans:                # Return the required number             return i            # Driver code if __name__ == "__main__":        arr = [5, 2, 3]      n = 12       print(findSmallestNumber(arr, n))   # This code is contributed by Rituraj Jain
2

rituraj_jain
Numbers
Arrays
Greedy
Mathematical
Queue
Sorting
Arrays
Greedy
Mathematical
Sorting
Numbers
Queue
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Chocolate Distribution Problem
Reversal algorithm for array rotation
Window Sliding Technique
Next Greater Element
Find duplicates in O(n) time and O(1) extra space | Set 1
Dijkstra's shortest path algorithm | Greedy Algo-7
Kruskal’s Minimum Spanning Tree Algorithm | Greedy Algo-2
Prim’s Minimum Spanning Tree (MST) | Greedy Algo-5
Huffman Coding | Greedy Algo-3
Write a program to print all permutations of a given string