Count of pairs in Array whose product is divisible by K
Last Updated :
26 Oct, 2023
Given an array A[] and positive integer K, the task is to count the total number of pairs in the array whose product is divisible by K.
Examples :
Input: A[] = [1, 2, 3, 4, 5], K = 2
Output: 7
Explanation: The 7 pairs of indices whose corresponding products are divisible by 2 are
(0, 1), (0, 3), (1, 2), (1, 3), (1, 4), (2, 3), and (3, 4).
Other pairs such as (0, 2) and (2, 4) have products 3 and 15 respectively, which are not divisible by 2.
Input: A[] = [1, 2, 3, 4], K = 5
Output: 0
Explanation: There does not exist any pair of indices whose corresponding product is divisible by 5.
Naive approach: For finding the counts of all pairs we can simply do a nested loop iteration and for each of element we can check all remaining elements whether their product is divisible by given key or not.
Algorithm:
- Initialize a counter variable count to 0.
- Loop i from 0 to N-1
- Loop j from i+1 to N-1
i. If A[i]*A[j] is divisible by K, then increment count by 1.
- Return count as the final result.
Below is the implementation of the approach:
C++
// C++ code for the approach
#include <bits/stdc++.h>
using namespace std;
// Function to count the number of pairs in the array
// whose product is divisible by K
int countPairs(int arr[], int n, int k)
{
int count = 0;
// Loop to iterate through all pairs of elements in the array
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
// Check if the product of elements is divisible by K
if ((arr[i] * arr[j]) % k == 0) {
count++;
}
}
}
return count;
}
// Driver code
int main()
{
int arr[] = { 1, 2, 3, 4, 5 };
int n = sizeof(arr) / sizeof(arr[0]);
int k = 2;
// Call the function to count the number of pairs
int count = countPairs(arr, n, k);
// Print the count of pairs
cout << count << endl;
return 0;
}
import java.util.*;
public class Main {
// Function to count the number of pairs in the array
// whose product is divisible by K
static int countPairs(int[] arr, int n, int k) {
int count = 0;
// Loop to iterate through all pairs of elements in the array
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
// Check if the product of elements is divisible by K
if ((arr[i] * arr[j]) % k == 0) {
count++;
}
}
}
return count;
}
// Driver code
public static void main(String[] args) {
int[] arr = { 1, 2, 3, 4, 5 };
int n = arr.length;
int k = 2;
// Call the function to count the number of pairs
int count = countPairs(arr, n, k);
// Print the count of pairs
System.out.println(count);
}
}
# Function to count the number of pairs in the list
# whose product is divisible by k
def countPairs(arr, k):
count = 0
# Loop to iterate through all pairs of elements in the list
for i in range(len(arr)):
for j in range(i + 1, len(arr)):
# Check if the product of elements is divisible by k
if (arr[i] * arr[j]) % k == 0:
count += 1
return count
# Driver code
arr = [1, 2, 3, 4, 5]
k = 2
# Call the function to count the number of pairs
count = countPairs(arr, k)
# Print the count of pairs
print(count)
using System;
class Program
{
// Function to count the number of pairs in the array
// whose product is divisible by K
static int CountPairs(int[] arr, int n, int k)
{
int count = 0;
// Loop to iterate through all pairs of elements in the array
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
// Check if the product of elements is divisible by K
if ((arr[i] * arr[j]) % k == 0)
{
count++;
}
}
}
return count;
}
// Main method
static void Main()
{
int[] arr = { 1, 2, 3, 4, 5 };
int n = arr.Length;
int k = 2;
// Call the function to count the number of pairs
int count = CountPairs(arr, n, k);
// Print the count of pairs
Console.WriteLine(count);
}
}
// Function to count the number of pairs in the array
// whose product is divisible by K
function countPairs(arr, k) {
let count = 0;
// Loop to iterate through all pairs of elements in the array
for (let i = 0; i < arr.length; i++) {
for (let j = i + 1; j < arr.length; j++) {
// Check if the product of elements is divisible by K
if ((arr[i] * arr[j]) % k === 0) {
count++;
}
}
}
return count;
}
// Driver code
let arr = [1, 2, 3, 4, 5];
let k = 2;
// Call the function to count the number of pairs
let count = countPairs(arr, k);
// Print the count of pairs
console.log(count);
Time Complexity: O(N2)
Auxiliary Space: O(1)
Efficient approach: The problem can be solved efficiently using hashing based on the following observation:
- For checking the divisibility of product with K, better to deal with the GCD of number with K. This will remove all other factors from consideration. As, the number of divisors of K, would be very small when compared with the length of original array size.
- If GCD(a, K) * GCD(b, K) is divisible by key, then a * b should also be divisible by key.
Follow the steps mentioned below to solve the problem:
- Create a map which will store the GCD(A[i], K) as key and its occurrence as value.
- For each element of the array, check all elements of map, whether map's element is divisible by X (X = quotient when K is divide by GCD(A[i], K))
- if yes add the occurrence of that element from map to answer.
- Also, keep incrementing the occurrence for each element's GCD with key.
- Return the final count.
Below is the implementation of the above approach
C++
// C++ program for the above approach
#include <bits/stdc++.h>
using namespace std;
// Program to count pairs whose product
// is divisible by key
long long countPairs(vector<int>& A, int
key)
{
long long ans = 0;
unordered_map<int, int> mp;
for (auto ele : A) {
// Calculate gcd of nums[i] and
// key
long long gcd = __gcd(key, ele);
long long x = key / gcd;
// Iterate over all possible gcds
for (auto it : mp)
if (it.first % x == 0)
// Add count to answer
ans += it.second;
// Add gcd to map
mp[gcd]++;
}
return ans;
}
// Driver code
int main()
{
vector<int> A = { 1, 2, 3, 4, 5 };
int key = 2;
cout << countPairs(A, key) << endl;
return 0;
}
// JAVA program for the above approach
import java.util.*;
class GFG {
public static int agcd(int a, int b)
{
if (b == 0)
return a;
return agcd(b, a % b);
}
// Program to count pairs whose product
// is divisible by key
public static long countPairs(int[] A, int key)
{
long ans = 0;
HashMap<Long, Integer> mp = new HashMap<>();
for (int i = 0; i < A.length; ++i)
{
// Calculate gcd of nums[i] and
// key
long gcd = agcd(key, A[i]);
long x = key / gcd;
// Iterate over all possible gcds
for (Map.Entry<Long, Integer> it :
mp.entrySet())
if (it.getKey() % x == 0)
// Add count to answer
ans += it.getValue();
// Add gcd to map
if (mp.containsKey(gcd)) {
mp.put(gcd, mp.get(gcd) + 1);
}
else {
mp.put(gcd, 1);
}
// mp[gcd]++;
}
return ans;
}
// Driver code
public static void main(String[] args)
{
int A[] = new int[] { 1, 2, 3, 4, 5 };
int key = 2;
System.out.println(countPairs(A, key));
}
}
// This code is contributed by Taranpreet
# Python3 Program to count pairs whose product
# is divisible by key
import math
def countPairs(A,key):
ans = 0
mp = {}
for ele in A:
# Calculate gcd of nums[i] and
# key
gcd = math.gcd(ele, key)
x = key // gcd
# Iterate over all possible gcds
for Key,value in mp.items():
if (Key % x == 0):
# Add count to answer
ans += value
# Add gcd to map
if(gcd in mp):
mp[gcd] = mp[gcd] + 1
else:
mp[gcd] = 1
return ans
# Driver code
A = [ 1, 2, 3, 4, 5 ]
key = 2
print(countPairs(A, key))
# This code is contributed by shinjanpatra
// C# program for the above approach
using System;
using System.Collections.Generic;
class GFG {
static int agcd(int a, int b)
{
if (b == 0)
return a;
return agcd(b, a % b);
}
// Program to count pairs whose product
// is divisible by key
static long countPairs(int[] A, int key)
{
long ans = 0;
Dictionary<long, int> mp
= new Dictionary<long, int>();
for (int i = 0; i < A.Length; ++i) {
// Calculate gcd of nums[i] and
// key
long gcd = agcd(key, A[i]);
long x = key / gcd;
// Iterate over all possible gcds
foreach(KeyValuePair<long, int> it in mp)
{
if (it.Key % x == 0)
// Add count to answer
ans += it.Value;
}
// Add gcd to map
if (mp.ContainsKey(gcd)) {
mp[gcd] = mp[gcd] + 1;
}
else {
mp.Add(gcd, 1);
}
// mp[gcd]++;
}
return ans;
}
// Driver code
public static void Main()
{
int[] A = { 1, 2, 3, 4, 5 };
int key = 2;
Console.WriteLine(countPairs(A, key));
}
}
// This code is contributed by Samim Hossain Mondal.
<script>
// Program to count pairs whose product
// is divisible by key
function _gcd(x,y){
if(!y)return x;
return _gcd(y,x%y);
}
function countPairs(A,key){
let ans = 0
let mp = new Map()
for(let ele of A){
// Calculate gcd of nums[i] and
// key
let gcd = _gcd(ele,key)
let x = Math.floor(key / gcd)
// Iterate over all possible gcds
for(let [Key,value] of mp){
if (Key % x == 0)
// Add count to answer
ans += value
}
// Add gcd to map
if(mp.has(gcd))
mp.set(gcd,mp.get(gcd)+1)
else
mp.set(gcd,1)
}
return ans
}
// Driver code
let A = [ 1, 2, 3, 4, 5 ]
let key = 2
document.write(countPairs(A, key))
// code is contributed by shinjanpatra
</script>
Time Complexity: O(N*K1/2)
Space Complexity: O(K1/2)
Similar Reads
Count pairs in Array whose product is divisible by K Given a array vec and an integer K, count the number of pairs (i, j) such that vec[i]*vec[j] is divisible by K where i<j. Examples: Input: vec = {1, 2, 3, 4, 5, 6}, K = 4Output: 6Explanation: The pairs of indices (0, 3), (1, 3), (2, 3), (3, 4), (3, 5) and (1, 5) satisfy the condition as their pro
11 min read
Count pairs in array whose sum is divisible by K Given an array A[] and positive integer K, the task is to count the total number of pairs in the array whose sum is divisible by K. Note: This question is a generalized version of this Examples: Input : A[] = {2, 2, 1, 7, 5, 3}, K = 4 Output : 5 Explanation : There are five pairs possible whose sum
10 min read
Count pairs in array whose sum is divisible by K Given an array A[] and positive integer K, the task is to count the total number of pairs in the array whose sum is divisible by K. Note: This question is a generalized version of this Examples: Input : A[] = {2, 2, 1, 7, 5, 3}, K = 4 Output : 5 Explanation : There are five pairs possible whose sum
10 min read
Count sub-arrays whose product is divisible by k Given an integer K and an array arr[], the task is to count all the sub-arrays whose product is divisible by K.Examples: Input: arr[] = {6, 2, 8}, K = 4 Output: 4 Required sub-arrays are {6, 2}, {6, 2, 8}, {2, 8}and {8}.Input: arr[] = {9, 1, 14}, K = 6 Output: 1 Naive approach: Run nested loops and
15+ min read
Count sub-arrays whose product is divisible by k Given an integer K and an array arr[], the task is to count all the sub-arrays whose product is divisible by K.Examples: Input: arr[] = {6, 2, 8}, K = 4 Output: 4 Required sub-arrays are {6, 2}, {6, 2, 8}, {2, 8}and {8}.Input: arr[] = {9, 1, 14}, K = 6 Output: 1 Naive approach: Run nested loops and
15+ min read
Count pairs whose products exist in array Given an array, count those pair whose product value is present in array. Examples: Input : arr[] = {6, 2, 4, 12, 5, 3}Output : 3 All pairs whose product exist in array (6 , 2) (2, 3) (4, 3) Input : arr[] = {3, 5, 2, 4, 15, 8}Output : 2 A Simple solution is to generate all pairs of given array and c
15+ min read