Given an array, count pairs in the array such that one element of pair divides other.
Examples:
Input : arr[] = {1, 2, 3}
Output : 2
The two pairs are (1, 2) and (1, 3)
Input : arr[] = {2, 3, 5, 7}
Output: 0
C++
// CPP program to count divisible pairs. #include <bits/stdc++.h> using namespace std; int countDivisibles(int arr[], int n) { int res = 0; // Iterate through all pairs for (int i=0; i<n; i++) for (int j=i+1; j<n; j++) // Increment count if one divides // other if (arr[i] % arr[j] == 0 || arr[j] % arr[i] == 0) res++; return res; } int main() { int a[] = {1, 2, 3, 9}; int n = sizeof(a) / sizeof(a[0]); cout << countDivisibles(a, n); return 0; } |
chevron_right
filter_none
Java
// Java program to count // divisible pairs. class GFG { // Function returns count // of divisible pairs static int countDivisibles(int arr[], int n) { int res = 0; // Iterate through all pairs for (int i = 0; i < n; i++) for (int j = i + 1; j < n; j++) // Increment count if // one divides other if (arr[i] % arr[j] == 0 || arr[j] % arr[i] == 0) res++; return res; } // Driver Code public static void main(String[] args) { int a[] = new int[]{1, 2, 3, 9}; int n = a.length; System.out.print(countDivisibles(a, n)); } } // This code is contributed by Smitha. |
chevron_right
filter_none
Python3
# Python3 program to count # divisible pairs. def countDivisibles(arr, n) : res = 0 # Iterate through all pairs for i in range(0, n) : for j in range(i+1, n) : # Increment count if one divides # other if (arr[i] % arr[j] == 0 or arr[j] % arr[i] == 0) : res+=1 return res # Driver code if __name__=='__main__': a = [1, 2, 3, 9] n = len(a) print(countDivisibles(a, n) ) # this code is contributed by # Smitha Dinesh Semwal |
chevron_right
filter_none
C#
// Java program to count // divisible pairs. using System; class GFG { // Function returns count // of divisible pairs static int countDivisibles(int []arr, int n) { int res = 0; // Iterate through all pairs for (int i = 0; i < n; i++) for (int j = i + 1; j < n; j++) // Increment count if // one divides other if (arr[i] % arr[j] == 0 || arr[j] % arr[i] == 0) res++; return res; } // Driver Code public static void Main(String[] args) { int[] a = new int[4] {1, 2, 3, 9}; int n = a.Length; Console.Write(countDivisibles(a, n)); } } // This code is contributed by Smitha. |
chevron_right
filter_none
PHP
<?php // PHP program to count divisible pairs. function countDivisibles($arr, $n) { $res = 0; // Iterate through all pairs for ($i = 0; $i < $n; $i++) for ($j = $i + 1; $j < $n; $j++) // Increment count if one divides // other if ($arr[$i] % $arr[$j] == 0 || $arr[$j] % $arr[$i] == 0) $res++; return $res; } $a = array(1, 2, 3, 9); $n = count($a); echo (countDivisibles($a, $n)); ?> |
chevron_right
filter_none
Output:
4
Efficient solution for small ranged numbers.
1) Insert all elements of array in a hash table.
2) Find maximum element in the array.
3) For every array element, search multiples of it (till maximum) in the hash table. If found, increment result.
Different cases like negative numbers and repetitions can also be handled here with slight modifications to the approach.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Count the number of pairs (i, j) such that either arr[i] is divisible by arr[j] or arr[j] is divisible by arr[i]
- Count pairs in array whose sum is divisible by 4
- Count number of pairs in array having sum divisible by K | SET 2
- Count pairs in array whose sum is divisible by K
- Count pairs in an array whose absolute difference is divisible by K
- Count of pairs of Array elements which are divisible by K when concatenated
- Split an array into groups of 3 such that X3 is divisible by X2 and X2 is divisible by X1
- Count pairs from 1 to N such that their Sum is divisible by their XOR
- Check if an array can be divided into pairs whose sum is divisible by k
- Given an array of pairs, find all symmetric pairs in it
- Find the maximum cost of an array of pairs choosing at most K pairs
- Print k numbers where all pairs are divisible by m
- No of pairs (a[j] >= a[i]) with k numbers in range (a[i], a[j]) that are divisible by x
- Largest divisible pairs subset
- Maximize the number of sum pairs which are divisible by K
- Length of longest subsequence having absolute difference of all pairs divisible by K
- Check if array can be sorted by swapping pairs with GCD of set bits count equal to that of the smallest array element
- Count all distinct pairs of repeating elements from the array for every array element
- Maximize count of pairs (i, j) from two arrays having element from first array not exceeding that from second array
- Count elements that are divisible by at-least one element in another array
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.
