Question

Please give answer fast.It is important​

Answer 1

smallest number k such that the product of digits of k is equal to n

Find the smallest number whose digits multiply to a given number n

Find smallest number with given number of digits and sum of digits

Find the smallest number whose sum of digits is N

Smallest number greater than Y with sum of digits equal to X

Program for Fibonacci numbers

Program for nth Catalan Number

Bell Numbers (Number of ways to Partition a Set)

Binomial Coefficient | DP-9

Permutation Coefficient

Tiling Problem

Gold Mine Problem

Coin Change | DP-7

Find minimum number of coins that make a given value

Greedy Algorithm to find Minimum number of Coins

K Centers Problem | Set 1 (Greedy Approximate Algorithm)

Minimum Number of Platforms Required for a Railway/Bus Station

Reverse an array in groups of given size

K’th Smallest/Largest Element in Unsorted Array | Set 1

K’th Smallest/Largest Element in Unsorted Array | Set 2 (Expected Linear Time)

K’th Smallest/Largest Element in Unsorted Array | Set 3 (Worst Case Linear Time)

K’th Smallest/Largest Element using STL

k largest(or smallest) elements in an array | added Min Heap method

Sort a nearly sorted (or K sorted) array

Merge k sorted arrays | Set 1

Write a program to print all permutations of a given string

Set in C++ Standard Template Library (STL)

C++ Data Types

Find the smallest number whose digits multiply to a given number n

Difficulty Level : Medium

Last Updated : 08 Mar, 2021

Given a number ‘n’, find the smallest number ‘p’ such that if we multiply all digits of ‘p’, we get ‘n’. The result ‘p’ should have minimum two digits.

Examples: 

 

Input: n = 36

Output: p = 49

// Note that 4*9 = 36 and 49 is the smallest such number

Input: n = 100

Output: p = 455

// Note that 4*5*5 = 100 and 455 is the smallest such number

Input: n = 1

Output:p = 11

// Note that 1*1 = 1

Input: n = 13

Output: Not Possible