C++ Exercises: Break a given integer in at least two parts to maximize the product of those integers
C++ Math: Exercise-28 with Solution
Write a C++ program to break a given integer in at least two parts (positive integers) to maximize the product of those integers.
Sample Input: n = 5
After breaking in +ve integers maximumn product from 5 = 6
Sample Input: n = 12
After breaking in +ve integers maximumn product from 12 = 81
Sample Solution:
C++ Code :
#include <iostream>
#include <cmath>
using namespace std;
int integer_Break(int n) {
if (n == 2) {
return 1;
} else if (n == 3) {
return 2;
} else if (n % 3 == 0) {
return (int) pow(3, n / 3);
} else if (n % 3 == 1) {
return 2 * 2 * (int) pow(3, (n - 4) / 3);
} else {
return 2 * (int) pow(3, n / 3);
}
}
int main()
{
int n = 5; // (3 + 2) -> 3 x 2 = 6
cout << "\nAfter breaking in +ve integers maximumn product from " << n << " = " << integer_Break(n) << endl;
n = 12; // (3 + 3 + 3 + 3) -> 3 x 3 x 3 x 3 = 81
cout << "\nAfter breaking in +ve integers maximumn product from " << n << " = " << integer_Break(n) << endl;
n = 17; // (3 + 3 + 3 + 3 + 3 + 2) -> 3 x 3 x 3 x 3 x 3 x 2 = 486
cout << "\nAfter breaking in +ve integers maximumn product from " << n << " = " << integer_Break(n) << endl;
return 0;
}
Sample Output:
After breaking in +ve integers maximumn product from 5 = 6 After breaking in +ve integers maximumn product from 12 = 81 After breaking in +ve integers maximumn product from 17 = 486
Flowchart:
C++ Code Editor:
Contribute your code and comments through Disqus.
Previous: Write a C++ program to find the number of perfect square (e.g. 1, 4, 9, 16, ...) numbers which represent a sum of a given number.
Next: Write a C++ program to count all the numbers with unique digits within a given range 0 ≤ y < 10n where y represent the unique digits numbers and take n as a input from the user.
What is the difficulty level of this exercise?