Skip to content
Related Articles

Related Articles

Improve Article

Partitions possible such that the minimum element divides all the other elements of the partition

  • Difficulty Level : Easy
  • Last Updated : 26 Apr, 2021

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: 
 

  1. Find the minimum element in the array which is not equal to INT_MAX.
  2. Remove all the elements (replace by INT_MAX) from the array divisible by the minimum element.
  3. 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;
}
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
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
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
Javascript



<script>
// Javascript implementation of the approach
var INT_MAX = 1000000000;
 
function min_element(A, N)
{
    var min = A[0];
    var 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
function countPartitions(A, N)
{
    // Initialize the count variable
    var count = 0;
    var i, j;
     
    for (i = 0; i < N; i++)
    {
 
        // Find the minimum element
        var 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
var arr = [ 7, 6, 5, 4, 3, 2, 2, 3 ];
var N = arr.length;
document.write(countPartitions(arr, N)); 
 
// This code is contributed by rutvik_56.
</script>
Output: 
4
 
Time Complexity: O(N2)
 



My Personal Notes
arrow_drop_up
Next

Find a Square Matrix such that sum of elements in every row and column is K
Recommended Articles
Page :
Find two co-prime integers such that the first divides A and the second divides B
09, Sep 19
Count of triplets (a, b, c) in the Array such that a divides b and b divides c
13, May 20
Minimum possible value T such that at most D Partitions of the Array having at most sum T is possible
21, Aug 20
Sum of elements of all partitions of number such that no element is less than K
06, Sep 18
Minimum value that divides one number and divisible by other
21, Dec 18
Maximum partitions possible of given Array with cost at most K and equal count of odd and even elements
21, Jun 21
Largest possible Subset from an Array such that no element is K times any other element in the Subset
28, Jul 20
Partition a set into two subsets such that difference between max of one and min of other is minimized
16, Jun 20
Find element in array that divides all array elements
22, Nov 17
Highest power of a number that divides other number
22, Apr 19
Find the index of the element in an array which divides most elements before it
09, Jan 20
Number of positions such that adding K to the element is greater than sum of all other elements
01, May 19
Lengths of maximized partitions of a string such that each character of the string appears in one substring
15, Sep 20
Maximized partitions of a string such that each character of the string appears in one substring
15, Sep 20
Maximize partitions such that no two substrings have any common character
25, Jun 20
Smallest positive integer that divides all array elements to generate quotients with sum not exceeding K
18, Dec 20
Maximum possible remainder when an element is divided by other element in the array
19, Nov 19
Maximum possible sum of a window in an array such that elements of same window in other array are unique
04, Aug 17
Find the array element having minimum sum of absolute differences with all other array elements
04, Jun 21
Minimum partitions of maximum size 2 and sum limited by given value
04, Sep 18
Legendre's formula (Given p and n, find the largest x such that p^x divides n!)
02, Jun 15
Find a distinct pair (x, y) in given range such that x divides y
13, Mar 19
Count of pairs in an array such that the highest power of 2 that divides their product is 1
29, Oct 19
Generate all unique partitions of an integer
20, Dec 13
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
rupesh_rao
@rupesh_rao
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox