B'You are given an array a_1, a_2, ... , a_n consisting of n distinct integers. Count the number of pairs of indices (i, j) such that i < j and a_i cdot a_j = i + j . The first line contains one integer t ( 1 <= q t <= q 10^4 ) -- the number of test cases. Then t cases follow. The first line of each test case contains one integer n ( 2 <= q n <= q 10^5 ) -- the length of array a . The second line of each test case contains n space separated integers a_1, a_2, ldots, a_n ( 1 <= q a_i <= q 2 cdot n ) -- the array a . It is guaranteed that all elements are distinct. It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case, output the number of pairs of indices (i, j) such that i < j and a_i cdot a_j = i + j . For the first test case, the only pair that satisfies the constraints is (1, 2) , as a_1 cdot a_2 = 1 + 2 = 3 For the second test case, the only pair that satisfies the constraints is (2, 3) . For the third test case, the pairs that satisfy the constraints are (1, 2) , (1, 5) , and (2, 3) . '...