Minimum number of given operations required to reduce the array to 0 element
Given an array arr[] of N integers. The task is to find the minimum number of given operations required to reduce the array to 0 element. In a single operation, any element can be chosen from the array and all of its multiples get removed including itself.
Examples:
Input: arr[] = {2, 4, 6, 3, 4, 6, 8}
Output: 2
Operation 1: Choose 2 and delete all the multiples, arr[] = {3}
Operation 3: Choose 3 and the array gets reduced to 0 element.Input: arr[] = {2, 4, 2, 4, 4, 4}
Output: 1
Naive approach: Find minimum from the array at each step and traverse the entire array to find multiples of this elements and delete them.
Efficient approach:
- Create a count array which stores the count of each number in the array.
- Since we know that for a number x the elements which satisfies the condition (A % x == 0) are actually the multiples of x and hence we need to find the multiples for every number and set their frequencies to 0 including the chosen element itself.
- Now for every number we traverse it’s multiples once and subtract the value of the count of that number from all of it’s multiples.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach #include <bits/stdc++.h> using namespace std; // Function to return the minimum // operations required int minOperations(int* arr, int n) { int maxi, result = 0; // Count the frequency of each element vector<int> freq(1000001, 0); for (int i = 0; i < n; i++) { int x = arr[i]; freq[x]++; } // Maximum element from the array maxi = *(max_element(arr, arr + n)); for (int i = 1; i <= maxi; i++) { if (freq[i] != 0) { // Find all the multiples of i for (int j = i * 2; j <= maxi; j = j + i) { // Delete the multiples freq[j] = 0; } // Increment the operations result++; } } return result; } // Driver code int main() { int arr[] = { 2, 4, 2, 4, 4, 4 }; int n = sizeof(arr) / sizeof(arr[0]); cout << minOperations(arr, n); return 0; } |
chevron_right
filter_none
Java
// Java implementation of the approach import java.util.Arrays; class GFG { // Function to return the minimum // operations required static int minOperations(int[] arr, int n) { int maxi, result = 0; // Count the frequency of each element int[] freq = new int[1000001]; for (int i = 0; i < n; i++) { int x = arr[i]; freq[x]++; } // Maximum element from the array maxi = Arrays.stream(arr).max().getAsInt(); for (int i = 1; i <= maxi; i++) { if (freq[i] != 0) { // Find all the multiples of i for (int j = i * 2; j <= maxi; j = j + i) { // Delete the multiples freq[j] = 0; } // Increment the operations result++; } } return result; } // Driver code public static void main(String[] args) { int arr[] = {2, 4, 2, 4, 4, 4}; int n = arr.length; System.out.println(minOperations(arr, n)); } } // This code is contributed by 29AjayKumar |
chevron_right
filter_none
Python3
# Python3 implementation of the approach # Function to return the minimum # operations required def minOperations(arr, n): result = 0 # Count the frequency of each element freq = [0] * 1000001 for i in range(0, n): freq[arr[i]] += 1 # Maximum element from the array maxi = max(arr) for i in range(1, maxi+1): if freq[i] != 0: # Find all the multiples of i for j in range(i * 2, maxi+1, i): # Delete the multiples freq[j] = 0 # Increment the operations result += 1 return result # Driver code if __name__ == "__main__": arr = [2, 4, 2, 4, 4, 4] n = len(arr) print(minOperations(arr, n)) # This code is contributed by Rituraj Jain |
chevron_right
filter_none
C#
// C# implementation of above approach using System; using System.Linq; class GFG { // Function to return the minimum // operations required static int minOperations(int[] arr, int n) { int maxi, result = 0; // Count the frequency of each element int[] freq = new int[1000001]; for (int i = 0; i < n; i++) { int x = arr[i]; freq[x]++; } // Maximum element from the array maxi = arr.Max(); for (int i = 1; i <= maxi; i++) { if (freq[i] != 0) { // Find all the multiples of i for (int j = i * 2; j <= maxi; j = j + i) { // Delete the multiples freq[j] = 0; } // Increment the operations result++; } } return result; } // Driver code public static void Main(String[] args) { int []arr = {2, 4, 2, 4, 4, 4}; int n = arr.Length; Console.WriteLine(minOperations(arr, n)); } } // This code is contributed by Rajput-Ji |
chevron_right
filter_none
PHP
<?php // PHP implementation of the approach // Function to return the minimum // operations required function minOperations($arr, $n) { $result = 0; $freq = array(); // Count the frequency of each element for($i = 0; $i < $n; $i++) { $freq[$arr[$i]] = 0; } for ($i = 0; $i < $n; $i++) { $x = $arr[$i]; $freq[$x]++; } // Maximum element from the array $maxi = max($arr); for ($i = 1; $i <= $maxi; $i++) { if ($freq[$i] != 0) { // Find all the multiples of i for ($j = $i * 2; $j <= $maxi; $j = $j + $i) { // Delete the multiples $freq[$j] = 0; } // Increment the operations $result++; } } return $result; } // Driver code $arr = array( 2, 4, 2, 4, 4, 4 ); $n = count($arr); echo minOperations($arr, $n); // This code is contributed by AnkitRai01 ?> |
chevron_right
filter_none
Output:
1
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
Recommended Posts:
- Minimum number of operations required to reduce N to 1
- Minimum number of operations required to delete all elements of the array
- Count the number of operations required to reduce the given number
- Find the minimum number of operations required to make all array elements equal
- Reduce the array to atmost one element by the given operations
- Reduce N to 1 with minimum number of given operations
- Minimum steps required to reduce all the elements of the array to zero
- Minimum operations required to make every element greater than or equal to K
- Count operations of the given type required to reduce N to 0
- Minimum operations required to remove an array
- Minimum operations required to change the array such that |arr[i] - M| <= 1
- Minimum no. of operations required to make all Array Elements Zero
- Minimum number operations required to convert n to m | Set-2
- Minimize operations required to make each element of Array equal to it's index value
- Minimum operations required to make all Array elements divisible by K
- Minimum operations required to make all the array elements equal
- Minimum operations required to make all the elements distinct in an array
- Minimum increment or decrement operations required to make the array sorted
- Minimum operations required to modify the array such that parity of adjacent elements is different
- Minimum changes required to make all element in an array equal
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
- Count of substrings of length K with exactly K distinct characters
- Real-time application of Data Structures
- Replace every element of array with sum of elements on its right side
- Longest subarray whose elements can be made equal by maximum K increments
- Count of subarrays of size K with elements having even frequencies