countTriplets.js

/**
You are given an array and you need to find number of tripets of indices (i, j, k) such that the elements at those indices are in geometric progression for a given common ratio r and i < j < k.]

For example, arr = [1,4,16,64]. If r=4, we have [1,4,16] and [4,16,64] at indices (0,1,2) and (1,2,3).

Sample Input 0

4 2
1 2 2 4

Sample Output 0

2

Explanation 0

There are
triplets in satisfying our criteria, whose indices are and

Sample Input 1

6 3
1 3 9 9 27 81

Sample Output 1

6


 */