Count of pairs in Array whose product is divisible by K
Last Updated :
23 Jul, 2025
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
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem