Partitions possible such that the minimum element divides all the other elements of the partition
Given an integer array arr[], the task is to count the number of partitions possible such that in each partition the minimum element divides all the other elements of the partition. The partition need not be continuous.
Examples:
Input: arr[] = {10, 7, 20, 21, 13}
Output: 3
The possible partitions are {10, 20}, {7, 21} and {13}.
In each partition, all the elements are divisible by
the minimum element of the partition.Input: arr[] = {7, 6, 5, 4, 3, 2, 2, 3}
Output: 4
Approach:
- Find the minimum element in the array which is not equal to INT_MAX.
- Remove all the elements (replace by INT_MAX) from the array divisible by the minimum element.
- The number of valid minimum elements as a result of the operations is the required number of partitions.
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 count partitions // possible from the given array such that // the minimum element of any partition // divides all the other elements // of that partition int countPartitions(int A[], int N) { // Initialize the count variable int count = 0; for (int i = 0; i < N; i++) { // Find the minimum element int min_elem = *min_element(A, A + N); // Break if no minimum element present if (min_elem == INT_MAX) break; // Increment the count if // minimum element present count++; // Replace all the element // divisible by min_elem for (int i = 0; i < N; i++) { if (A[i] % min_elem == 0) A[i] = INT_MAX; } } return count; } // Driver code int main() { int arr[] = { 7, 6, 5, 4, 3, 2, 2, 3 }; int N = sizeof(arr) / sizeof(arr[0]); cout << countPartitions(arr, N); return 0; } |
chevron_right
filter_none
Java
// Java implementation of the approach class GFG { static int INT_MAX = Integer.MAX_VALUE ; static int min_element(int []A, int N) { int min = A[0]; int i; for( i = 1; i < N ; i++) { if (min > A[i]) { min = A[i]; } } return min; } // Function to return the count partitions // possible from the given array such that // the minimum element of any partition // divides all the other elements // of that partition static int countPartitions(int []A, int N) { // Initialize the count variable int count = 0; int i, j; for (i = 0; i < N; i++) { // Find the minimum element int min_elem = min_element(A, N); // Break if no minimum element present if (min_elem == INT_MAX) break; // Increment the count if // minimum element present count++; // Replace all the element // divisible by min_elem for (j = 0; j < N; j++) { if (A[j] % min_elem == 0) A[j] = INT_MAX; } } return count; } // Driver code public static void main (String[] args) { int arr[] = { 7, 6, 5, 4, 3, 2, 2, 3 }; int N = arr.length; System.out.println(countPartitions(arr, N)); } } // This code is contributed by AnkitRai01 |
chevron_right
filter_none
Python3
# Python3 implementation of the approach import sys INT_MAX = sys.maxsize; # Function to return the count partitions # possible from the given array such that # the minimum element of any partition # divides all the other elements # of that partition def countPartitions(A, N) : # Initialize the count variable count = 0; for i in range(N) : # Find the minimum element min_elem = min(A); # Break if no minimum element present if (min_elem == INT_MAX) : break; # Increment the count if # minimum element present count += 1; # Replace all the element # divisible by min_elem for i in range(N) : if (A[i] % min_elem == 0) : A[i] = INT_MAX; return count; # Driver code if __name__ == "__main__" : arr = [ 7, 6, 5, 4, 3, 2, 2, 3 ]; N = len(arr); print(countPartitions(arr, N)); # This code is contributed by AnkitRai01 |
chevron_right
filter_none
C#
// C# implementation of the approach using System; class GFG { static int INT_MAX = int.MaxValue ; static int min_element(int []A, int N) { int min = A[0]; int i; for( i = 1; i < N ; i++) { if (min > A[i]) { min = A[i]; } } return min; } // Function to return the count partitions // possible from the given array such that // the minimum element of any partition // divides all the other elements // of that partition static int countPartitions(int []A, int N) { // Initialize the count variable int count = 0; int i, j; for (i = 0; i < N; i++) { // Find the minimum element int min_elem = min_element(A, N); // Break if no minimum element present if (min_elem == INT_MAX) break; // Increment the count if // minimum element present count++; // Replace all the element // divisible by min_elem for (j = 0; j < N; j++) { if (A[j] % min_elem == 0) A[j] = INT_MAX; } } return count; } // Driver code public static void Main() { int []arr = { 7, 6, 5, 4, 3, 2, 2, 3 }; int N = arr.Length; Console.WriteLine(countPartitions(arr, N)); } } // This code is contributed by AnkitRai01 |
chevron_right
filter_none
Output:
4
Time Complexity: O(N2)
Recommended Posts:
- Sum of elements of all partitions of number such that no element is less than K
- Find the index of the element in an array which divides most elements before it
- Find element in array that divides all array elements
- Minimum partitions of maximum size 2 and sum limited by given value
- Merge K minimum elements of the array until there is only one element
- Minimum array element changes to make its elements 1 to N
- Smallest integer > 1 which divides every element of the given array
- Minimum value that divides one number and divisible by other
- Remove minimum number of elements such that no common element exist in both array
- Remove minimum elements from array such that no three consecutive element are either increasing or decreasing
- Find an element which divides the array in two subarrays with equal product
- Equal sum array partition excluding a given element
- Find a number that divides maximum array elements
- Find integers that divides maximum number of elements of the array
- Find two co-prime integers such that the first divides A and the second divides B
- Count of triplets (a, b, c) in the Array such that a divides b and b divides c
- Minimum cost to partition the given binary string
- Minimum toggles to partition a binary array so that it has first 0s then 1s
- Flip minimum signs of array elements to get minimum sum of positive elements possible
- Check if minimum element in array is less than or equals half of every other element
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.
Improved By : AnkitRai01
- Count of substrings of length K with exactly K distinct characters
- Count the number of ways to construct the target string
- Finding Median of unsorted Array in linear time using C++ STL
- Longest subarray whose elements can be made equal by maximum K increments
- Replace every element of array with sum of elements on its right side