Cpp14 Program to Maximize difference between sum of prime and non-prime array elements by left shifting of digits minimum number of times
Given an array arr[] of size N, the task is to find the maximum difference between the sum of the prime numbers and the sum of the non-prime numbers present in the array, by left shifting the digits of array elements by 1 minimum number of times.
Examples:
Input: arr[] = {541, 763, 321, 716, 143}
Output: Difference = 631, Count of operations = 6
Explanation:
Operation 1: Left shift the digits of arr[1] (= 763). Therefore, arr[1] becomes 637.
Operation 2: Left shift the digits of arr[1] (= 637). Therefore, arr[1] becomes 376.
Operation 3: Left shift the digits of arr[2] (= 321). Therefore, arr[2] becomes 213.
Operation 4: Left shift the digits of arr[2] (= 213). Therefore, arr[2] becomes 132.
Operation 5: Left shift the digits of arr[3] (= 716). Therefore, arr[3] becomes 167.
Operation 6: Left shift the digits of arr[4] (= 143). Therefore, arr[4] becomes 431.
Therefore, Sum of prime array elements = 541 + 167 + 431 = 1139.
Therefore, sum of non-prime array elements = 376 + 132 = 508.
Therefore, difference = 1139 – 508 = 631.
Input: {396, 361, 359, 496, 780}
Output: Difference = 236, Count of operations = 4
Explanation:
Operation 1: Left shift the digits of arr[1] (= 361). Therefore, arr[1] becomes 613.
Operation 2: Left shift the digits of arr[2] (= 359). Therefore, arr[2] becomes 593.
Operation 3: Left shift the digits of arr[4] (= 780). Therefore, arr[4] becomes 807.
Operation 4: Left shift the digits of arr[4] (= 807). Therefore, arr[4] becomes 078.
Therefore, required difference = 613 + 593 – 496 – 78 – 396 = 236.
Approach: The given problem can be solved greedily. If it is possible to convert an element into one or more than one prime number, then take the maximum of them. Otherwise, try to minimize the element by using all the possible rotations.
Follow the steps below to solve the problem:
- Initialize two variables, say ans and cost, to store the maximum difference and the minimum number of operations required respectively.
- Traverse the array arr[] using a variable i and perform the following steps:
- Initialize variables maxPrime and minRotation as -1 to store the maximum prime number and minimum number that can be obtained from arr[i] through left rotations.
- Generate all left rotations of the number arr[i].
- If the value of maxPrime remains unchanged, find the value of minRotation by similarly generating all the left rotations.
- Add the value of arr[i] to ans.
- After completing the above steps, print the value of ans and cost as the result.
Below is the implementation of the above approach:
C++14
#include <bits/stdc++.h>
using namespace std;
bool isPrime( int n)
{
if (n <= 1)
return false ;
if (n <= 3)
return true ;
if (n % 2 == 0 || n % 3 == 0)
return false ;
int i = 5;
while (i * i <= n) {
if (n % i == 0 || n % (i + 2) == 0)
return false ;
i = i + 6;
}
return true ;
}
pair< int , int > rotateElement( int n)
{
string strN = to_string(n);
int maxPrime = -1;
int cost = 0;
string temp = strN;
for ( int i = 0; i < strN.size(); i++) {
if (isPrime(stoi(temp)) && stoi(temp) > maxPrime) {
maxPrime = stoi(temp);
cost = i;
}
temp = temp.substr(1) + temp[0];
}
int optEle = maxPrime;
if (optEle == -1) {
optEle = INT_MAX;
temp = strN;
for ( int i = 0; i < strN.size(); i++) {
if (stoi(temp) < optEle) {
optEle = stoi(temp);
cost = i;
}
temp = temp.substr(1) + temp[0];
}
optEle *= (-1);
}
return { optEle, cost };
}
void getMaxSum( int arr[], int N)
{
int maxSum = 0, cost = 0;
for ( int i = 0; i < N; i++) {
int x = arr[i];
pair< int , int > ret = rotateElement(x);
int optEle = ret.first, optCost = ret.second;
maxSum += optEle;
cost += optCost;
}
cout << "Difference = " << maxSum << " , "
<< "Count of operations = " << cost;
}
int main()
{
int arr[] = { 541, 763, 321, 716, 143 };
int N = sizeof (arr) / sizeof (arr[0]);
getMaxSum(arr, N);
return 0;
}
|
Output:
Difference = 631 , Count of operations = 6
Time Complexity: O(N*√X*log(X)), where X is the largest element in the array
Auxiliary Space: O(1)
Please refer complete article on Maximize difference between sum of prime and non-prime array elements by left shifting of digits minimum number of times for more details!
Last Updated :
17 Aug, 2023
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...