for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
s = 3
count = 0
for i in range(n):
for j in range(a[i] - i - 2, n, a[i]):
if i >= j:continue
if a[i] * a[j] == i + j + 2:
count += 1
print(count)
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define print(a) for(auto it:a) std::cout<<it<<" ";
#define nl "\n"
typedef long long ll;
typedef long double ld;
void solve() {
int n;cin >> n;
vector<pair<ll,ll>> a(n);
for(int i=0;i<n;i++) {
int x;cin >> x;
a[i] = {x,i+1};
}
sort(all(a));
ll count = 0;
for(int i=0;i<n-1;i++) {
for(int j=i+1;j<n;j++) {
if(a[i].first*a[j].first == a[i].second + a[j].second) count ++;
else if(a[i].first*a[j].first >= 2*n) break;
else continue;
}
}
cout << count << nl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll t;cin >> t;
while(t--) {
solve();
}
return 0;
}152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |