Skip to content
Related Articles

Related Articles

Related Articles

Save Article
Improve Article
Save Article
Like Article

Count of triplets in an array that satisfy the given conditions

  • Last Updated : 14 May, 2021

Given an array arr[] of N elements, the task is to find the count of triplets (arr[i], arr[j], arr[k]) such that (arr[i] + arr[j] + arr[k] = L) and (L % arr[i] = L % arr[j] = L % arr[k] = 0.
Examples: 
 

Input: arr[] = {2, 4, 5, 6, 7} 
Output: 1 
Only possible triplet is {2, 4, 6}
Input: arr[] = {4, 4, 4, 4, 4} 
Output: 10 
 

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.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

 



Approach: 
 

  • Consider the equations below: 
     

L = a * arr[i], L = b * arr[j] and L = c * arr[k]. 
Thus, arr[i] = L / a, arr[j] = L / b and arr[k] = L / c. 
So, using this in arr[i] + arr[j] + arr[k] = L gives L / a + L / b + L / c = L 
or 1 / a + 1 / b + 1 / c = 1. 
Now, there can only be 10 possible solutions of the above equation, which are 
{2, 3, 6} 
{2, 4, 4} 
{2, 6, 3} 
{3, 2, 6} 
{3, 3, 3} 
{3, 6, 2} 
{4, 2, 4} 
{4, 4, 2} 
{6, 2, 3} 
{6, 3, 2}
All possible triplets (arr[i], arr[j], arr[k]) will satisfy these solutions. So, all these solutions can be stored in a 2D array say test[][3]. So, that all the triplets which satisfy these solutions can be found. 
 

  •  
  • For all i from 1 to N. Consider arr[i] as the middle element of the triplet. And find corresponding first and third elements of the triplet for all possible solutions of the equation 1 / a + 1 / b + 1 / c = 1. Find the answer for all the cases and add them to the final answer.
  • Maintain the indices where arr[i] occurs in the array. For a given possible solution of equation X and for every number arr[i] keep the number as middle element of triplet and find the first and the third element. Apply binary search on the available set of indices for the first and the third element to find the number of occurrence of the first element from 1 to i – 1 and the number of occurrences of the third element from i + 1 to N. Multiply both the values and add it to the final answer.

Below is the implementation of the above approach: 
 

C++




// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MAX 100001
#define ROW 10
#define COl 3
 
vector<int> indices[MAX];
 
// All possible solutions of the
// equation 1/a + 1/b + 1/c = 1
int test[ROW][COl] = { { 2, 3, 6 },
                       { 2, 4, 4 },
                       { 2, 6, 3 },
                       { 3, 2, 6 },
                       { 3, 3, 3 },
                       { 3, 6, 2 },
                       { 4, 2, 4 },
                       { 4, 4, 2 },
                       { 6, 2, 3 },
                       { 6, 3, 2 } };
 
// Function to find the triplets
int find_triplet(int array[], int n)
{
    int answer = 0;
 
    // Storing indices of the elements
    for (int i = 0; i < n; i++) {
        indices[array[i]].push_back(i);
    }
 
    for (int i = 0; i < n; i++) {
        int y = array[i];
 
        for (int j = 0; j < ROW; j++) {
            int s = test[j][1] * y;
 
            // Check if y can act as the middle
            // element of triplet with the given
            // solution of 1/a + 1/b + 1/c = 1
            if (s % test[j][0] != 0)
                continue;
            if (s % test[j][2] != 0)
                continue;
 
            int x = s / test[j][0];
            ll z = s / test[j][2];
            if (x > MAX || z > MAX)
                continue;
 
            int l = 0;
            int r = indices[x].size() - 1;
 
            int first = -1;
 
            // Binary search to find the number of
            // possible values of the first element
            while (l <= r) {
                int m = (l + r) / 2;
 
                if (indices[x][m] < i) {
                    first = m;
                    l = m + 1;
                }
                else {
                    r = m - 1;
                }
            }
 
            l = 0;
            r = indices[z].size() - 1;
 
            int third = -1;
 
            // Binary search to find the number of
            // possible values of the third element
            while (l <= r) {
                int m = (l + r) / 2;
 
                if (indices[z][m] > i) {
                    third = m;
                    r = m - 1;
                }
                else {
                    l = m + 1;
                }
            }
 
            if (first != -1 && third != -1) {
 
                // Contribution to the answer would
                // be the multiplication of the possible
                // values for the first and the third element
                answer += (first + 1) * (indices[z].size() - third);
            }
        }
    }
 
    return answer;
}
 
// Driver code
int main()
{
    int array[] = { 2, 4, 5, 6, 7 };
    int n = sizeof(array) / sizeof(array[0]);
 
    cout << find_triplet(array, n);
 
    return 0;
}
Java



// Java implementation of the approach
import java.util.*;
 
class GFG
{
 
static int MAX = 100001;
static int ROW = 10;
static int COl = 3;
 
static Vector<Integer> []indices = new Vector[MAX];
 
// All possible solutions of the
// equation 1/a + 1/b + 1/c = 1
static int test[][] = { { 2, 3, 6 }, { 2, 4, 4 },
                        { 2, 6, 3 }, { 3, 2, 6 },
                        { 3, 3, 3 }, { 3, 6, 2 },
                        { 4, 2, 4 }, { 4, 4, 2 },
                        { 6, 2, 3 }, { 6, 3, 2 } };
 
// Function to find the triplets
static int find_triplet(int array[], int n)
{
    int answer = 0;
    for (int i = 0; i < MAX; i++)
    {
        indices[i] = new Vector<>();
    }
     
    // Storing indices of the elements
    for (int i = 0; i < n; i++)
    {
        indices[array[i]].add(i);
    }
 
    for (int i = 0; i < n; i++)
    {
        int y = array[i];
 
        for (int j = 0; j < ROW; j++)
        {
            int s = test[j][1] * y;
 
            // Check if y can act as the middle
            // element of triplet with the given
            // solution of 1/a + 1/b + 1/c = 1
            if (s % test[j][0] != 0)
                continue;
            if (s % test[j][2] != 0)
                continue;
 
            int x = s / test[j][0];
            int z = s / test[j][2];
            if (x > MAX || z > MAX)
                continue;
 
            int l = 0;
            int r = indices[x].size() - 1;
 
            int first = -1;
 
            // Binary search to find the number of
            // possible values of the first element
            while (l <= r)
            {
                int m = (l + r) / 2;
 
                if (indices[x].get(m) < i)
                {
                    first = m;
                    l = m + 1;
                }
                else
                {
                    r = m - 1;
                }
            }
 
            l = 0;
            r = indices[z].size() - 1;
 
            int third = -1;
 
            // Binary search to find the number of
            // possible values of the third element
            while (l <= r)
            {
                int m = (l + r) / 2;
 
                if (indices[z].get(m) > i)
                {
                    third = m;
                    r = m - 1;
                }
                else
                {
                    l = m + 1;
                }
            }
 
            if (first != -1 && third != -1)
            {
 
                // Contribution to the answer would
                // be the multiplication of the possible
                // values for the first and the third element
                answer += (first + 1) * (indices[z].size() - third);
            }
        }
    }
    return answer;
}
 
// Driver code
public static void main(String []args)
{
    int array[] = { 2, 4, 5, 6, 7 };
    int n = array.length;
 
    System.out.println(find_triplet(array, n));
}
}
 
// This code is contributed by Rajput-Ji
Python3



# Python3 implementation of the approach
MAX = 100001
ROW = 10
COL = 3
 
indices = [0] * MAX
 
# All possible solutions of the
# equation 1/a + 1/b + 1/c = 1
test = [[2, 3, 6], [2, 4, 4],
        [2, 6, 3], [3, 2, 6],
        [3, 3, 3], [3, 6, 2],
        [4, 2, 4], [4, 4, 2],
        [6, 2, 3], [6, 3, 2]]
 
# Function to find the triplets
def find_triplet(array, n):
    answer = 0
 
    for i in range(MAX):
        indices[i] = []
 
    # Storing indices of the elements
    for i in range(n):
        indices[array[i]].append(i)
 
    for i in range(n):
        y = array[i]
 
        for j in range(ROW):
            s = test[j][1] * y
 
            # Check if y can act as the middle
            # element of triplet with the given
            # solution of 1/a + 1/b + 1/c = 1
            if s % test[j][0] != 0:
                continue
            if s % test[j][2] != 0:
                continue
 
            x = s // test[j][0]
            z = s // test[j][2]
            if x > MAX or z > MAX:
                continue
 
            l = 0
            r = len(indices[x]) - 1
            first = -1
 
            # Binary search to find the number of
            # possible values of the first element
            while l <= r:
                m = (l + r) // 2
 
                if indices[x][m] < i:
                    first = m
                    l = m + 1
                else:
                    r = m - 1
 
            l = 0
            r = len(indices[z]) - 1
            third = -1
 
            # Binary search to find the number of
            # possible values of the third element
            while l <= r:
                m = (l + r) // 2
 
                if indices[z][m] > i:
                    third = m
                    r = m - 1
                else:
                    l = m + 1
 
            if first != -1 and third != -1:
 
                # Contribution to the answer would
                # be the multiplication of the possible
                # values for the first and the third element
                answer += (first + 1) * (len(indices[z]) - third)
    return answer
 
# Driver Code
if __name__ == "__main__":
    array = [2, 4, 5, 6, 7]
    n = len(array)
 
    print(find_triplet(array, n))
 
# This code is contributed by
# sanjeev2552
C#



// C# implementation of the approach
using System;
using System.Collections.Generic;
 
class GFG
{
 
static int MAX = 100001;
static int ROW = 10;
static int COl = 3;
 
static List<int> []indices = new List<int>[MAX];
 
// All possible solutions of the
// equation 1/a + 1/b + 1/c = 1
static int [,]test = { { 2, 3, 6 }, { 2, 4, 4 },
                       { 2, 6, 3 }, { 3, 2, 6 },
                       { 3, 3, 3 }, { 3, 6, 2 },
                       { 4, 2, 4 }, { 4, 4, 2 },
                       { 6, 2, 3 }, { 6, 3, 2 } };
 
// Function to find the triplets
static int find_triplet(int []array, int n)
{
    int answer = 0;
    for (int i = 0; i < MAX; i++)
    {
        indices[i] = new List<int>();
    }
     
    // Storing indices of the elements
    for (int i = 0; i < n; i++)
    {
        indices[array[i]].Add(i);
    }
 
    for (int i = 0; i < n; i++)
    {
        int y = array[i];
 
        for (int j = 0; j < ROW; j++)
        {
            int s = test[j, 1] * y;
 
            // Check if y can act as the middle
            // element of triplet with the given
            // solution of 1/a + 1/b + 1/c = 1
            if (s % test[j, 0] != 0)
                continue;
            if (s % test[j, 2] != 0)
                continue;
 
            int x = s / test[j, 0];
            int z = s / test[j, 2];
            if (x > MAX || z > MAX)
                continue;
 
            int l = 0;
            int r = indices[x].Count - 1;
 
            int first = -1;
 
            // Binary search to find the number of
            // possible values of the first element
            while (l <= r)
            {
                int m = (l + r) / 2;
 
                if (indices[x][m] < i)
                {
                    first = m;
                    l = m + 1;
                }
                else
                {
                    r = m - 1;
                }
            }
 
            l = 0;
            r = indices[z].Count - 1;
 
            int third = -1;
 
            // Binary search to find the number of
            // possible values of the third element
            while (l <= r)
            {
                int m = (l + r) / 2;
 
                if (indices[z][m] > i)
                {
                    third = m;
                    r = m - 1;
                }
                else
                {
                    l = m + 1;
                }
            }
 
            if (first != -1 && third != -1)
            {
 
                // Contribution to the answer would
                // be the multiplication of the possible
                // values for the first and the third element
                answer += (first + 1) * (indices[z].Count - third);
            }
        }
    }
    return answer;
}
 
// Driver code
public static void Main(String []args)
{
    int []array = { 2, 4, 5, 6, 7 };
    int n = array.Length;
 
    Console.WriteLine(find_triplet(array, n));
}
}
 
// This code is contributed by Rajput-Ji
Javascript



<script>
 
// Javascript implementation of the approach
 
var MAX = 100001
var ROW = 10
var COl = 3
 
var indices = Array.from(Array(MAX), ()=>new Array());
 
// All possible solutions of the
// equation 1/a + 1/b + 1/c = 1
var test = [ [ 2, 3, 6 ],
                       [ 2, 4, 4 ],
                       [ 2, 6, 3 ],
                       [ 3, 2, 6 ],
                       [ 3, 3, 3 ],
                       [ 3, 6, 2 ],
                       [ 4, 2, 4 ],
                       [ 4, 4, 2 ],
                       [ 6, 2, 3 ],
                       [ 6, 3, 2 ] ];
 
// Function to find the triplets
function find_triplet(array, n)
{
    var answer = 0;
 
    // Storing indices of the elements
    for (var i = 0; i < n; i++) {
        indices[array[i]].push(i);
    }
 
    for (var i = 0; i < n; i++) {
        var y = array[i];
 
        for (var j = 0; j < ROW; j++) {
            var s = test[j][1] * y;
 
            // Check if y can act as the middle
            // element of triplet with the given
            // solution of 1/a + 1/b + 1/c = 1
            if (s % test[j][0] != 0)
                continue;
            if (s % test[j][2] != 0)
                continue;
 
            var x = s / test[j][0];
            var z = s / test[j][2];
            if (x > MAX || z > MAX)
                continue;
 
            var l = 0;
            var r = indices[x].length - 1;
 
            var first = -1;
 
            // Binary search to find the number of
            // possible values of the first element
            while (l <= r) {
                var m = (l + r) / 2;
 
                if (indices[x][m] < i) {
                    first = m;
                    l = m + 1;
                }
                else {
                    r = m - 1;
                }
            }
 
            l = 0;
            r = indices[z].length - 1;
 
            var third = -1;
 
            // Binary search to find the number of
            // possible values of the third element
            while (l <= r) {
                var m = (l + r) / 2;
 
                if (indices[z][m] > i) {
                    third = m;
                    r = m - 1;
                }
                else {
                    l = m + 1;
                }
            }
 
            if (first != -1 && third != -1) {
 
                // Contribution to the answer would
                // be the multiplication of the possible
                // values for the first and the third element
                answer += (first + 1) * (indices[z].length - third);
            }
        }
    }
 
    return answer;
}
 
// Driver code
var array = [2, 4, 5, 6, 7];
var n = array.length;
document.write( find_triplet(array, n));
 
</script>
Output: 
1
 



My Personal Notes
arrow_drop_up
Previous
Find the number of positive integers less than or equal to N that have an odd number of digits
Next

Number of index pairs such that s[i] and s[j] are anagrams
Recommended Articles
Page :
Count of triplets that satisfy the given equation
29, Aug 19
Count pairs of strings that satisfy the given conditions
28, Jun 19
Minimum increment/decrement operations required on Array to satisfy given conditions
19, Aug 20
Queries to update array elements in a range [L, R] to satisfy given conditions
15, Jan 21
Count of indices in an array that satisfy the given condition
28, Nov 19
Count of unordered pairs (x, y) of Array which satisfy given equation
03, Jul 20
Sum of absolute differences of pairs from the given array that satisfy the given condition
06, Sep 19
Count sub-sets that satisfy the given condition
18, Dec 18
Count index pairs which satisfy the given condition
15, May 19
Count of Fibonacci pairs which satisfy the given equation
03, Apr 20
Count possible permutations of given array satisfying the given conditions
06, Oct 20
Pairs from an array that satisfy the given condition
27, Dec 18
Append two elements to make the array satisfy the given condition
02, Jan 20
Generate an array B[] from the given array A[] which satisfies the given conditions
21, Oct 19
Generate an array using given conditions from a given array
04, Apr 20
Count of triplets from the given Array such that sum of any two elements is the third element
27, Feb 20
Count of triplets in a given Array having GCD K
19, Jun 20
Count triplets having product 0 from a given array
16, Oct 20
Count valid pairs in the array satisfying given conditions
11, Dec 18
Count of operations required to update the array such that it satisfies the given conditions
26, Sep 19
Count of elements in array A left after performing deletion/rotation operation based on given conditions
22, Jul 21
Count number of coordinates from an array satisfying the given conditions
30, Apr 21
Choose X elements from A[] and Y elements from B[] which satisfy the given condition
04, Oct 19
Minimum number of leaves required to be removed from a Tree to satisfy the given condition
05, Aug 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
krikti
@krikti
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