Skip to content
Related Articles

Related Articles

Improve Article

Product of all the pairs from the given array

  • Last Updated : 14 May, 2021

Given an array arr[] of N integers, the task is to find the product of all the pairs possible from the given array such as: 

  • (arr[i], arr[i]) is also considered as a valid pair.
  • (arr[i], arr[j]) and (arr[j], arr[i]) are considered as two different pairs.

Print the resultant answer modulus 10^9+7.

Examples:  

Input: arr[] = {1, 2} 
Output: 16 
Explanation: 
All valid pairs are (1, 1), (1, 2), (2, 1) and (2, 2). 
Hence, 1 * 1 * 1 * 2 * 2 * 1 * 2 * 2 = 16

Input: arr[] = {1, 2, 3} 
Output: 46656 
Explanation: 
All valid pairs are (1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2) and (3, 3). 
Hence the product is 1*1*1**2*1*3*2*1*2*2*2*3*3*1*3*2*3*3 = 46656 



Naive Approach: To solve the problem mentioned above the naive method is to find all the possible pairs and calculate the product of the elements of each pair.

Below is the implementation of the above approach:  

C++




// C++ implementation to find the
// product of all the pairs from
// the given array
 
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
 
// Function to return the product of
// the elements of all possible pairs
// from the array
int productPairs(int arr[], int n)
{
 
    // To store the required product
    int product = 1;
 
    // Nested loop to calculate all
    // possible pairs
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
 
            // Multiply the product of
            // the elements of the
            // current pair
            product *= (arr[i] % mod
                        * arr[j] % mod)
                       % mod;
            product = product % mod;
        }
    }
 
    // Return the final result
    return product % mod;
}
 
// Driver code
int main()
{
    int arr[] = { 1, 2, 3 };
 
    int n = sizeof(arr) / sizeof(arr[0]);
 
    cout << productPairs(arr, n);
 
    return 0;
}
Java



// Java implementation to find the
// product of all the pairs from
// the given array
import java.util.*;
 
class GFG{
     
static final int mod = 1000000007;
 
// Function to return the product of
// the elements of all possible pairs
// from the array
static int productPairs(int arr[], int n)
{
 
    // To store the required product
    int product = 1;
 
    // Nested loop to calculate all
    // possible pairs
    for(int i = 0; i < n; i++)
    {
       for(int j = 0; j < n; j++)
       {
           
          // Multiply the product
          // of the elements of the
          // current pair
          product *= (arr[i] % mod *
                      arr[j] % mod) % mod;
          product = product % mod;
       }
    }
 
    // Return the final result
    return product % mod;
}
 
// Driver code
public static void main(String[] args)
{
    int arr[] = { 1, 2, 3 };
    int n = arr.length;
 
    System.out.print(productPairs(arr, n));
}
}
 
// This code is contributed by sapnasingh4991
Python3



# Python3 implementation to find the
# product of all the pairs from
# the given array
mod = 1000000007;
 
# Function to return the product of
# the elements of all possible pairs
# from the array
def productPairs(arr, n):
   
    # To store the required product
    product = 1;
 
    # Nested loop to calculate all
    # possible pairs
    for i in range(n):
        for j in range(n):
           
            # Multiply the product
            # of the elements of the
            # current pair
            product *= (arr[i] % mod *
                        arr[j] % mod) % mod;
            product = product % mod;
 
    # Return the final result
    return product % mod;
 
# Driver code
if __name__ == '__main__':
    arr = [1, 2, 3];
    n = len(arr);
 
    print(productPairs(arr, n));
 
# This code is contributed by 29AjayKumar
C#



// C# implementation to find the
// product of all the pairs from
// the given array
using System;
class GFG{
     
static readonly int mod = 1000000007;
 
// Function to return the product of
// the elements of all possible pairs
// from the array
static int productPairs(int []arr, int n)
{
 
    // To store the required product
    int product = 1;
 
    // Nested loop to calculate all
    // possible pairs
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
                 
            // Multiply the product
            // of the elements of the
            // current pair
            product *= (arr[i] % mod *
                        arr[j] % mod) % mod;
            product = product % mod;
        }
    }
 
    // Return the readonly result
    return product % mod;
}
 
// Driver code
public static void Main(String[] args)
{
    int []arr = { 1, 2, 3 };
    int n = arr.Length;
 
    Console.Write(productPairs(arr, n));
}
}
 
// This code is contributed by sapnasingh4991
Javascript



<script>
 
//Javascript implementation to find the
// product of all the pairs from
// the given array
 
mod = 1000000007
 
// Function to return the product of
// the elements of all possible pairs
// from the array
function productPairs(arr, n)
{
 
    // To store the required product
    let product = 1;
 
    // Nested loop to calculate all
    // possible pairs
    for (let i = 0; i < n; i++) {
        for (let j = 0; j < n; j++) {
 
            // Multiply the product of
            // the elements of the
            // current pair
            product *= (arr[i] % mod
                        * arr[j] % mod)
                    % mod;
            product = product % mod;
        }
    }
 
    // Return the final result
    return product % mod;
}
 
// Driver code
    let arr = [ 1, 2, 3 ];
 
    let n = arr.length;
 
    document.write(productPairs(arr, n));
 
// This code is contributed by Mayank Tyagi
 
</script>
Output: 
46656
 
Time Complexity: O(N2)
Efficient approach: We can observe that each element appears exactly (2 * N) times as one of the elements of a pair (X, Y). Exactly N times as X and exactly N times as Y.
Below is the implementation of the above approach:  
C++



// C++ implementation to Find the product
// of all the pairs from the given array
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
 
// Function to calculate
// (x^y)%1000000007
int power(int x, unsigned int y)
{
    int p = 1000000007;
 
    // Initialize result
    int res = 1;
 
    // Update x if it is more than
    // or equal to p
    x = x % p;
 
    while (y > 0) {
        // If y is odd, multiply x
        // with result
        if (y & 1)
            res = (res * x) % p;
 
        y = y >> 1;
        x = (x * x) % p;
    }
 
    // Return the final result
    return res;
}
 
// Function to return the product
// of the elements of all possible
// pairs from the array
ll productPairs(ll arr[], ll n)
{
 
    // To store the required product
    ll product = 1;
 
    // Iterate for every element
    // of the array
    for (int i = 0; i < n; i++) {
 
        // Each element appears (2 * n) times
        product
            = (product
               % mod
               * (int)power(
                     arr[i], (2 * n))
               % mod)
              % mod;
    }
 
    return product % mod;
}
 
// Driver code
int main()
{
    ll arr[] = { 1, 2, 3 };
    ll n = sizeof(arr) / sizeof(arr[0]);
 
    cout << productPairs(arr, n);
 
    return 0;
}
Java



// Java implementation to Find the product
// of all the pairs from the given array
import java.util.*;
 
class GFG{
static final int mod = 1000000007;
 
// Function to calculate
// (x^y)%1000000007
static int power(int x, int y)
{
    int p = 1000000007;
 
    // Initialize result
    int res = 1;
 
    // Update x if it is more than
    // or equal to p
    x = x % p;
 
    while (y > 0)
    {
         
        // If y is odd, multiply x
        // with result
        if (y % 2 == 1)
            res = (res * x) % p;
 
        y = y >> 1;
        x = (x * x) % p;
    }
 
    // Return the final result
    return res;
}
 
// Function to return the product
// of the elements of all possible
// pairs from the array
static int productPairs(int arr[], int n)
{
 
    // To store the required product
    int product = 1;
 
    // Iterate for every element
    // of the array
    for (int i = 0; i < n; i++)
    {
 
        // Each element appears (2 * n) times
        product = (product % mod *
                  (int)power(arr[i],
                            (2 * n)) % mod) % mod;
    }
 
    return product % mod;
}
 
// Driver code
public static void main(String[] args)
{
    int arr[] = { 1, 2, 3 };
    int n = arr.length;
 
    System.out.print(productPairs(arr, n));
}
}
 
// This code is contributed by amal kumar choubey
Python3



# Python3 implementation to Find the product
# of all the pairs from the given array
mod = 1000000007
 
# Function to calculate
# (x^y)%1000000007
def power(x, y):
 
    p = 1000000007
 
    # Initialize result
    res = 1
 
    # Update x if it is more than
    # or equal to p
    x = x % p
 
    while (y > 0):
         
        # If y is odd, multiply x
        # with result
        if ((y & 1) != 0):
            res = (res * x) % p
 
        y = y >> 1
        x = (x * x) % p
 
    # Return the final result
    return res
 
# Function to return the product
# of the elements of all possible
# pairs from the array
def productPairs(arr, n):
 
    # To store the required product
    product = 1
 
    # Iterate for every element
    # of the array
    for i in range(n):
 
        # Each element appears (2 * n) times
        product = (product % mod *
          (int)(power(arr[i], (2 * n))) %
                            mod) % mod
 
    return (product % mod)
     
# Driver code
arr = [ 1, 2, 3 ]
n = len(arr)
 
print(productPairs(arr, n))
 
# This code is contributed by divyeshrabadiya07
C#



// C# implementation to Find the product
// of all the pairs from the given array
using System;
class GFG{
const int mod = 1000000007;
 
// Function to calculate
// (x^y)%1000000007
static int power(int x, int y)
{
    int p = 1000000007;
 
    // Initialize result
    int res = 1;
 
    // Update x if it is more than
    // or equal to p
    x = x % p;
 
    while (y > 0)
    {
         
        // If y is odd, multiply x
        // with result
        if (y % 2 == 1)
            res = (res * x) % p;
 
        y = y >> 1;
        x = (x * x) % p;
    }
 
    // Return the final result
    return res;
}
 
// Function to return the product
// of the elements of all possible
// pairs from the array
static int productPairs(int []arr, int n)
{
 
    // To store the required product
    int product = 1;
 
    // Iterate for every element
    // of the array
    for (int i = 0; i < n; i++)
    {
 
        // Each element appears (2 * n) times
        product = (product % mod *
                  (int)power(arr[i],
                            (2 * n)) % mod) % mod;
    }
 
    return product % mod;
}
 
// Driver code
public static void Main()
{
    int []arr = { 1, 2, 3 };
    int n = arr.Length;
 
    Console.Write(productPairs(arr, n));
}
}
 
// This code is contributed by Code_Mech
Javascript



<script>
 
// Javascript implementation to Find the product
// of all the pairs from the given array
  
let mod = 1000000007;
 
// Function to calculate
// (x^y)%1000000007
function power(x, y)
{
    let p = 1000000007;
  
    // Initialize result
    let res = 1;
  
    // Update x if it is more than
    // or equal to p
    x = x % p;
  
    while (y > 0)
    {
          
        // If y is odd, multiply x
        // with result
        if (y % 2 == 1)
            res = (res * x) % p;
  
        y = y >> 1;
        x = (x * x) % p;
    }
  
    // Return the final result
    return res;
}
  
// Function to return the product
// of the elements of all possible
// pairs from the array
function productPairs(arr, n)
{
  
    // To store the required product
    let product = 1;
  
    // Iterate for every element
    // of the array
    for (let i = 0; i < n; i++)
    {
  
        // Each element appears (2 * n) times
        product = (product % mod *
                  power(arr[i],
                            (2 * n)) % mod) % mod;
    }
  
    return product % mod;
}
  
  // Driver Code
     
    let arr = [ 1, 2, 3 ];
    let n = arr.length;
  
    document.write(productPairs(arr, n));
     
</script>
Output: 
46656
 
Time Complexity: O(N)
 
Attention reader! Don’t stop learning now. Join the First-Step-to-DSA Course for Class 9 to 12 students , specifically designed to introduce data structures and algorithms to the class 9 to 12 students



My Personal Notes
arrow_drop_up
Next

Sum of product of all pairs of array elements
Recommended Articles
Page :
Count pairs with product of indices equal to the product of elements present at those indices
18, Mar 21
Maximize product of array by replacing array elements with its sum or product with element from another array
27, Oct 20
Count pairs from a given array whose product lies in a given range
12, Jul 21
Maximum product from array such that frequency sum of all repeating elements in product is less than or equal to 2 * k
18, Feb 19
Sum of product of all unordered pairs in given range with update queries
10, Aug 21
Sum of product of all pairs of a Binary Array
30, Sep 20
Sum of product of all pairs of array elements
10, Jun 17
Minimize sum of absolute difference between all pairs of array elements by decrementing and incrementing pairs by 1
30, Jul 21
Minimum sum of product of elements of pairs of the given array
30, Mar 20
Find prime factors of Z such that Z is product of all even numbers till N that are product of two distinct prime numbers
28, Jun 21
Count all distinct pairs with product equal to K
26, Mar 20
Mean of array generated by products of all pairs of the given array
16, Oct 20
Generate an N-length array having GCD of all its pairs present in a given 2D array
30, Jul 21
Maximum of even or odd product pairs count from given arrays
16, Dec 20
Count of pairs in a given range with sum of their product and sum equal to their concatenated number
14, Jun 20
Count pairs with Even Product from two given arrays
11, Dec 20
Count of pairs in given range having their ratio equal to ratio of product of their digits
08, Sep 21
Number of pairs in an array such that product is greater than sum
22, Jun 17
Count pairs from an array having product of their sum and difference equal to 0
09, Oct 20
Count pairs in a sorted array whose product is less than k
19, Sep 18
Count of pairs in an array such that the highest power of 2 that divides their product is 1
29, Oct 19
Number of pairs in an array having sum equal to product
02, Jan 20
Count pairs in Array whose product is a Kth power of any positive integer
07, Apr 20
Count of index pairs in array whose range product is a positive integer
26, May 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
spp____
@spp____
Vote for difficulty





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