- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Suppose, we have one integer N > 0. The task is to find the maximum product of digits among numbers less than or equal to N. If the N is 390, then the result is 216, as the number 389 is making maximum product 3 * 8 * 9 = 216.

To solve this problem, we will use the recursive approach. So if N = 0, then return 1, if the number N < 10, then return N, otherwise return max(max_product(N/10) * (N mod 10), max_product((N/10) - 1)*9)

#include<iostream> using namespace std; int max_product(int N) { if (N == 0) return 1; if (N < 10) return N; return max(max_product(N / 10) * (N % 10), max_product(N / 10 - 1) * 9); } int main() { int N = 432; cout << "Maximum product is: " << max_product(N); }

Maximum product is: 243

- Related Questions & Answers
- Find all factorial numbers less than or equal to n in C++
- Print all prime numbers less than or equal to N in C++
- Print all Semi-Prime Numbers less than or equal to N in C++
- Find Multiples of 2 or 3 or 5 less than or equal to N in C++
- Find maximum sum array of length less than or equal to m in C++
- Find three integers less than or equal to N such that their LCM is maximum - C++
- Find three integers less than or equal to N such that their LCM is maximum in C++
- Find unique pairs such that each element is less than or equal to N in C++
- C++ find four factors of N with maximum product and sum equal to N .
- Maximum product from array such that frequency sum of all repeating elements in product is less than or equal to 2 * k in C++
- Find four factors of N with maximum product and sum equal to N in C++
- Recursive program to print all numbers less than N which consist of digits 1 or 3 only in C++
- Maximum sum subarray having sum less than or equal to given sums in C++
- C++ program to find unique pairs such that each element is less than or equal to N
- Count ordered pairs with product less than N in C++

Advertisements