Skip to content
Related Articles

Related Articles

Number of pairs in an array such that product is greater than sum
  • Difficulty Level : Medium
  • Last Updated : 30 Apr, 2021

Given a array a[] of non-negative integers. Count the number of pairs (i, j) in the array such that a[i] + a[j] < a[i]*a[j]. (the pair (i, j) and (j, i) are considered same and i should not be equal to j)
Examples: 
 

Input : a[] = {3, 4, 5}
Output : 3
Pairs are (3, 4) , (4, 5) and (3,5)

Input  : a[] = {1, 1, 1}
Output : 0

 

Naive approach 
For each value a[i] count the number of a[j] (i > j) such that a[i]*a[j] > a[i] + a[j] 
 

C++




// Naive C++ program to count number of pairs
// such that their sum is more than product.
#include<bits/stdc++.h>
using namespace std;
 
// Returns the number of valid pairs
int countPairs (int arr[], int n)
{   
    int ans = 0;  // initializing answer
 
    // Traversing the array. For each array
    // element, checking its predecessors that
    // follow the condition
    for (int i = 0; i<n; i++)
        for (int j = i-1; j>= 0; j--)
            if (arr[i]*arr[j] > arr[i] + arr[j])
                ans++;
    return ans;
}
 
// Driver function
int main()
{
    int arr[] = {3, 4, 5};
    int n = sizeof(arr)/sizeof(arr[0]);
    cout << countPairs(arr, n);
    return 0;
}
Java



// Naive java program to count number of pairs
// such that their sum is more than product.
import java.*;
 
public class GFG
{
     
    // Returns the number of valid pairs
    static int countPairs (int arr[], int n)
    {
        int ans = 0; // initializing answer
     
        // Traversing the array. For each array
        // element, checking its predecessors that
        // follow the condition
        for (int i = 0; i<n; i++)
            for (int j = i-1; j>= 0; j--)
                if (arr[i]*arr[j] > arr[i] + arr[j])
                    ans++;
        return ans;
    }
     
    // Driver code
    public static void main(String args[])
    {
        int arr[] = {3, 4, 5};
        int n = arr.length;
        System.out.println(countPairs(arr, n));
    }
}
 
// This code is contributed by Sam007
Python3



# Naive Python program to count number
# of pairs such that their sum is more
# than product.
 
# Returns the number of valid pairs
def countPairs(arr, n):
     
    # initializing answer
    ans = 0
     
    # Traversing the array. For each
    # array element, checking its
    # predecessors that follow the
    # condition
    for i in range(0, n):
        j = i-1
        while(j >= 0):
            if (arr[i] * arr[j] >
                     arr[i] + arr[j]):
                ans = ans + 1
            j = j - 1
    return ans
     
# Driver program to test above function.
arr = [3, 4, 5]
n = len(arr)
k = countPairs(arr, n)
print(k)
     
# This code is contributed by Sam007.
C#



// Naive C# program to count number of pairs
// such that their sum is more than product.
using System;
         
public class GFG
{
    // Returns the number of valid pairs
    static int countPairs (int []arr, int n)
    {
        int ans = 0; // initializing answer
     
        // Traversing the array. For each array
        // element, checking its predecessors that
        // follow the condition
        for (int i = 0; i<n; i++)
            for (int j = i-1; j>= 0; j--)
                if (arr[i]*arr[j] > arr[i] + arr[j])
                    ans++;
        return ans;
    }
     
    // driver program
    public static void Main()
    {
        int []arr = {3, 4, 5};
        int n = arr.Length;
        Console.Write( countPairs(arr, n));
    }
}
 
// This code is contributed by Sam007
PHP



<?php
// Naive PHP program to
// count number of pairs
// such that their sum
// is more than product.
 
// Returns the number
// of valid pairs
function countPairs ($arr, $n)
{
    // initializing answer
    $ans = 0;
 
    // Traversing the array.
    // For each array
    // element, checking
    // its predecessors that
    // follow the condition
    for ($i = 0; $i < $n; $i++)
        for ($j = $i - 1; $j >= 0; $j--)
            if ($arr[$i] * $arr[$j] >
                $arr[$i] + $arr[$j])
                $ans++;
    return $ans;
}
 
// Driver Code
$arr = array(3, 4, 5);
$n = sizeof($arr);
echo(countPairs($arr, $n));
 
// This code is contributed by Ajit.
?>
Javascript



<script>
    // Naive Javascript program to count number of pairs
    // such that their sum is more than product.
     
    // Returns the number of valid pairs
    function countPairs(arr, n)
    {
        let ans = 0; // initializing answer
       
        // Traversing the array. For each array
        // element, checking its predecessors that
        // follow the condition
        for (let i = 0; i<n; i++)
            for (let j = i-1; j>= 0; j--)
                if (arr[i]*arr[j] > (arr[i] + arr[j]))
                    ans++;
        return ans;
    }
     
    let arr = [3, 4, 5];
    let n = arr.length;
    document.write( countPairs(arr, n));
 
</script>
Output: 
 
3
Efficient approach 
When a[i] = 0 : a[i]*a[j] = 0 and a[i] + a[j] >= 0 so if a[i] = 0 no pairs can be found. 
When a[i] = 1 : a[i]*a[j] = a[j] and a[i] + a[j] = 1 + a[j], so no pairs can be found when a[i] = 1 
When a[i] = 2 and a[j] = 2 : a[i]*a[j] = a[i] + a[j] = 4 
When a[i] = 2 and a[j] > 2 or a[i] > 2 and a[j] >= 2 : All such pairs are valid.
To solve this problem, count the number of 2s in the array say twoCount. Count the numbers greater than 2 in the array say twoGreaterCount. Answer will be twoCount * twoGreaterCount + twoGreaterCount * (twoGreaterCount-1)/2 
 
C++



// C++ implementation of efficient approach
// to count valid pairs.
#include<bits/stdc++.h>
using namespace std;
 
// returns the number of valid pairs
int CountPairs (int arr[], int n)
{
    // traversing the array, counting the
    // number of 2s and greater than 2
    // in array
    int twoCount = 0, twoGrCount = 0;
    for (int i = 0; i<n; i++)
    {
        if (arr[i] == 2)
            twoCount++;
        else if (arr[i] > 2)
            twoGrCount++;
    }
    return twoCount*twoGrCount +
          (twoGrCount*(twoGrCount-1))/2;
}
 
// Driver function
int main()
{
    int arr[] = {3, 4, 5};
    int n = sizeof(arr)/sizeof(arr[0]);
    cout << CountPairs(arr, n);
    return 0;
}
Java



// Java implementation of efficient approach
// to count valid pairs.
import java.*;
 
public class GFG
{
    // Returns the number of valid pairs
    static int countPairs (int arr[], int n)
    {
        // traversing the array, counting the
        // number of 2s and greater than 2
        // in array
        int twoCount = 0, twoGrCount = 0;
        for (int i = 0; i<n; i++)
        {
          if (arr[i] == 2)
            twoCount++;
          else if (arr[i] > 2)
            twoGrCount++;
        }
        return twoCount*twoGrCount +
        (twoGrCount*(twoGrCount-1))/2;
    }
     
    // Driver code
    public static void main(String args[])
    {
        int arr[] = {3, 4, 5};
        int n = arr.length;
        System.out.println(countPairs(arr, n));
    }
}
 
// This code is contributed by Sam007
Python3



# python implementation of efficient approach
# to count valid pairs.
 
# returns the number of valid pairs
def CountPairs (arr,n):
     
    # traversing the array, counting the
    # number of 2s and greater than 2
    # in array
    twoCount = 0
    twoGrCount = 0
    for i in range(0, n):
         
        if (arr[i] == 2):
            twoCount += 1
        elif (arr[i] > 2):
            twoGrCount += 1
     
    return ((twoCount * twoGrCount)
      + (twoGrCount * (twoGrCount - 1)) / 2)
 
# Driver function
arr = [3, 4, 5]
n = len(arr)
print( CountPairs(arr, n))
 
# This code is contributed by Sam007.
C#



// C# implementation of efficient approach
// to count valid pairs.
using System;
         
public class GFG
{
    // Returns the number of valid pairs
    static int countPairs (int []arr, int n) {
         
    // traversing the array, counting the
    // number of 2s and greater than 2
    // in array
    int twoCount = 0, twoGrCount = 0;
    for (int i = 0; i<n; i++)
    {
        if (arr[i] == 2)
            twoCount++;
        else if (arr[i] > 2)
            twoGrCount++;
    }
    return twoCount*twoGrCount +
           (twoGrCount*(twoGrCount-1))/2;
    }
     
    // driver program
    public static void Main()
    {
        int []arr = {3, 4, 5};
        int n = arr.Length;
        Console.Write( countPairs(arr, n));
    }
}
 
// This code is contributed by Sam007
PHP



<?php
// PHP implementation of
// efficient approach
// to count valid pairs.
 
// returns the number
// of valid pairs
function CountPairs ($arr, $n)
{
     
    // traversing the array, counting
    // the number of 2s and greater
    // than 2 in array
    $twoCount = 0; $twoGrCount = 0;
     
    for ($i = 0; $i < $n; $i++)
    {
        if ($arr[$i] == 2)
            $twoCount++;
        else if ($arr[$i] > 2)
            $twoGrCount++;
    }
    return $twoCount * $twoGrCount +
          ($twoGrCount * ($twoGrCount -
                               1)) / 2;
}
 
// Driver Code
$arr = array(3, 4, 5);
$n = sizeof($arr);
echo(CountPairs($arr, $n));
 
// This code is contributed by Ajit.
?>
Javascript



<script>
    // Javascript implementation of efficient approach to count valid pairs.
     
    // returns the number of valid pairs
    function CountPairs(arr, n)
    {
        // traversing the array, counting the
        // number of 2s and greater than 2
        // in array
        let twoCount = 0, twoGrCount = 0;
        for (let i = 0; i<n; i++)
        {
            if (arr[i] == 2)
                twoCount++;
            else if (arr[i] > 2)
                twoGrCount++;
        }
        return twoCount*twoGrCount + parseInt((twoGrCount*(twoGrCount-1))/2, 10);
    }
     
    let arr = [3, 4, 5];
    let n = arr.length;
    document.write(CountPairs(arr, n));
 
</script>
Output: 
 
3
This article is contributed by Ayush Jha. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 



My Personal Notes
arrow_drop_up
Previous
Search an element in an unsorted array using minimum number of comparisons
Next

Image Manipulation Using Quadtrees
Recommended Articles
Page :
Number of pairs in an array with the sum greater than 0
13, Apr 20
Number of pairs in an array having sum equal to product
02, Jan 20
Count pairs in an array whose product is composite number
08, Oct 20
Find minimum value to assign all array elements so that array product becomes greater
21, Jun 17
Count pairs having bitwise XOR greater than K from a given array
25, Oct 20
Minimum element whose n-th power is greater than product of an array of size n
07, Oct 17
Product of all the pairs from the given array
31, May 20
Number of pairs whose product is a power of 2
13, Oct 20
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
Count number of ordered pairs with Even and Odd Product
01, Nov 18
Count pairs in a sorted array whose product is less than k
19, Sep 18
Minimum sum of product of elements of pairs of the given array
30, Mar 20
Count pairs from an array having product of their sum and difference equal to 0
09, Oct 20
Count pairs from an array having product of their sum and difference equal to 1
12, Oct 20
Count of pairs in an array whose product is a perfect square
18, Mar 20
Count of pairs in an array such that the highest power of 2 that divides their product is 1
29, Oct 19
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
Minimize array sum by replacing greater and smaller elements of pairs by half and double of their values respectively atmost K times
11, Nov 20
Maximum product of the remaining pair after repeatedly replacing pairs of adjacent array elements with their sum
10, Feb 21
Minimum number greater than the maximum of array which cannot be formed using the numbers in the array
23, Apr 19
Count pairs from an array whose Bitwise OR is greater than Bitwise AND
08, Feb 21
Maximize array product by changing any array element arr[i] to (-1)*arr[i] - 1 any number of times
16, Feb 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Medium





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