You are given an array and you need to find number of tripets of indices such that the elements at those indices are in geometric progression for a given common ratio and .
There are and at indices and . Return .
Complete the countTriplets function in the editor below.
countTriplets has the following parameter(s):
- int arr[n]: an array of integers
- int r: the common ratio
- int: the number of triplets
The first line contains two space-separated integers and , the size of and the common ratio.
The next line contains space-seperated integers .
Sample Input 0
4 2 1 2 2 4
Sample Output 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
The triplets satisfying are index , , , , and .
Sample Input 2
5 5 1 5 5 25 125
Sample Output 2
The triplets satisfying are index , , , .