Skip to content
Related Articles

Related Articles

Print all numbers up to N having product of digits equal to K
  • Difficulty Level : Expert
  • Last Updated : 09 Mar, 2021
GeeksforGeeks - Summer Carnival Banner

Given two integers N and K, the task is to print all the numbers from the range [1, N] whose product of digits is equal to K. If no such number is found, then print “-1”.

Examples:

Input: N =100, K = 25
Output: 55
Explanation: There is only a single number 55 whose product of digits is equal to K.

Input: N = 500, K = 10
Output: 25 52 125 152 215 251 

Approach: Follow the steps below to solve the problem:



  • Initialize a variable, say flag, to store whether any number satisfying the given conditions exists or not.
  • Declare a function, productOfDigits(), to find the product of digits of the number.
  • Iterate over the range [1, N]:
    • If the product of digits of arr[i] is equal to K, print that number and set flag = 1.
  • If flag is equal to 0, which means that no such number is found in the range [1, N]. Therefore, print “-1”.

Below is the implementation of the above approach:

C++




// C++ program for the above approach
 
#include <bits/stdc++.h>
using namespace std;
 
// Function to find the product
// of digits of a number
int productOfDigits(int N)
{
    // Stores the product of
    // digits of a number
    int product = 1;
 
    while (N != 0) {
        product = product * (N % 10);
        N = N / 10;
    }
 
    // Return the product
    return product;
}
 
// Function to print all numbers upto
// N having product of digits equal to K
void productOfDigitsK(int N, int K)
{
    // Stores whether any number satisfying
    // the given conditions exists or not
    int flag = 0;
 
    // Iterate over the range [1, N]
    for (int i = 1; i <= N; ++i) {
 
        // If product of digits of
        // arr[i] is equal to K or not
        if (K == productOfDigits(i)) {
 
            // Print that number
            cout << i << " ";
            flag = 1;
        }
    }
 
    // If no numbers are found
    if (flag == 0)
        cout << "-1";
}
 
// Driver Code
int main()
{
    // Given value of N & K
    int N = 500, K = 10;
 
    // Function call to print all numbers
    // from [1, N] with product of digits K
    productOfDigitsK(N, K);
}
Java



// Java Program to implement
// the above approach
import java.io.*;
import java.util.*;
 
class GFG {
 
  // Function to find the product
  // of digits of a number
  static int productOfDigits(int N)
  {
     
    // Stores the product of
    // digits of a number
    int product = 1;
 
    while (N != 0) {
      product = product * (N % 10);
      N = N / 10;
    }
 
    // Return the product
    return product;
  }
 
  // Function to print all numbers upto
  // N having product of digits equal to K
  static void productOfDigitsK(int N, int K)
  {
    // Stores whether any number satisfying
    // the given conditions exists or not
    int flag = 0;
 
    // Iterate over the range [1, N]
    for (int i = 1; i <= N; ++i) {
 
      // If product of digits of
      // arr[i] is equal to K or not
      if (K == productOfDigits(i)) {
 
        // Print that number
        System.out.print(i + " ");
        flag = 1;
      }
    }
 
    // If no numbers are found
    if (flag == 0)
      System.out.println(-1);
  }
 
  // Driver Code
  public static void main(String[] args)
  {
     
    // Given value of N & K
    int N = 500, K = 10;
 
    // Function call to print all numbers
    // from [1, N] with product of digits K
    productOfDigitsK(N, K);
  }
}
 
// This code is contribute by Kingash.
Python3



# Python3 program for the above approach
 
# Function to find the product
# of digits of a number
def productOfDigits(N) :
 
    # Stores the product of
    # digits of a number
    product = 1;
 
    while (N != 0) :
        product = product * (N % 10);
        N = N // 10;
 
    # Return the product
    return product;
 
# Function to print all numbers upto
# N having product of digits equal to K
def productOfDigitsK(N, K) :
 
    # Stores whether any number satisfying
    # the given conditions exists or not
    flag = 0;
 
    # Iterate over the range [1, N]
    for i in range(1, N + 1) :
 
        # If product of digits of
        # arr[i] is equal to K or not
        if (K == productOfDigits(i)) :
 
            # Print that number
            print(i, end =" ");
            flag = 1;
 
    # If no numbers are found
    if (flag == 0) :
        print("-1");
 
# Driver Code
if __name__ == "__main__" :
     
    # Given value of N & K
    N = 500; K = 10;
 
    # Function call to print all numbers
    # from [1, N] with product of digits K
    productOfDigitsK(N, K);
     
    # This code is contributed by AnkThon
C#



// C# program for the above approach
using System;
class GFG
{
 
  // Function to find the product
  // of digits of a number
  static int productOfDigits(int N)
  {
 
    // Stores the product of
    // digits of a number
    int product = 1;
 
    while (N != 0) {
      product = product * (N % 10);
      N = N / 10;
    }
 
    // Return the product
    return product;
  }
 
  // Function to print all numbers upto
  // N having product of digits equal to K
  static void productOfDigitsK(int N, int K)
  {
 
    // Stores whether any number satisfying
    // the given conditions exists or not
    int flag = 0;
 
    // Iterate over the range [1, N]
    for (int i = 1; i <= N; ++i) {
 
      // If product of digits of
      // arr[i] is equal to K or not
      if (K == productOfDigits(i)) {
 
        // Print that number
        Console.Write(i + " ");
        flag = 1;
      }
    }
 
    // If no numbers are found
    if (flag == 0)
      Console.WriteLine(-1);
  }
 
 
  // Driver Code
  static public void Main()
  {
 
    // Given value of N & K
    int N = 500, K = 10;
 
    // Function call to print all numbers
    // from [1, N] with product of digits K
    productOfDigitsK(N, K);
  }
}
 
// This code is contributed by jana_sayantan.
Output
25 52 125 152 215 251 
Time Complexity: O(N * logN)
Auxiliary Space: O(1)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
My Personal Notes
arrow_drop_up
Previous
Print all Perfect Numbers from an array whose sum of digits is also a Perfect Number
Next

Minimize difference between two sequences obtained by splitting first N powers of 2
Recommended Articles
Page :
Numbers of Length N having digits A and B and whose sum of digits contain only digits A and B
31, Jan 19
Numbers with sum of digits equal to the sum of digits of its all prime factor
20, Sep 18
Print all numbers in given range having digits in strictly increasing order
13, Jul 20
Count of numbers between range having only non-zero digits whose sum of digits is N and number is divisible by M
13, Feb 19
Count numbers from given range having odd digits at odd places and even digits at even places
02, Dec 20
Minimum digits to be removed to make either all digits or alternating digits same
15, Aug 20
Find maximum product of digits among numbers less than or equal to N
22, Apr 19
Count of N digit Numbers having no pair of equal consecutive Digits
12, Aug 20
Find all possible subarrays having product less than or equal to K
31, Aug 20
Check whether product of digits at even places is divisible by sum of digits at odd place of a number
19, Nov 18
Count of N-digit Numbers having Sum of even and odd positioned digits divisible by given numbers
07, Aug 20
Cumulative product of digits of all numbers in the given range
21, May 20
Kth element in permutation of first N natural numbers having all even numbers placed before odd numbers in increasing order
03, Mar 21
Find the array element from indices not divisible by K having largest composite product of digits
03, Jan 21
Find the number in a range having maximum product of the digits
31, Dec 18
Generate all N digit numbers having absolute difference as K between adjacent digits
26, Aug 20
Print all positions of a given string having count of smaller characters equal on both sides
25, Oct 20
Print all array elements having frequencies equal to powers of K in ascending order
10, Mar 21
Smallest number k such that the product of digits of k is equal to n
25, Sep 17
Smallest number whose product with N has sum of digits equal to that of N
15, Dec 20
Check if product of digits of a number at even and odd places is equal
27, Feb 19
Count of quadruples with product of a pair equal to the product of the remaining pair
08, Feb 21
Count pairs with product of indices equal to the product of elements present at those indices
18, Mar 21
Print all numbers less than N with at-most 2 unique digits
21, Nov 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
patelajeet
@patelajeet
Vote for difficulty
Current difficulty :
Expert





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox