2197D.cpp

#include <bits/stdc++.h>
using namespace std;
template<typename T>
void _debug(const char* name, T&& value) {
    cerr << name << " = " << value << endl;
}
template<typename T, typename... Args>
 void _debug(const char* names, T&& value, Args&&... args) {
    const char* comma = strchr(names, ',');
    cerr.write(names, comma - names) << " = " << value << " | ";
    _debug(comma + 1, args...);
}


#define debug(...) _debug(#__VA_ARGS__, __VA_ARGS__)
#define ll long long
#define REP(i,n) for(int i=0; i<n; i++)
#define RREP(i,n) for(int i=n-1; i>= 0; i--)
#define mod 1000000007

void solve()
{
    int n;
    cin >> n;
    vector<int> a(n); REP(i, n) cin >> a[i];
    int limit = sqrt(n);
    ll ans = 0;
    for (int val = 1; val <= limit; ++val) {
        REP(j,n){
            ll dist = (ll)val * a[j];
            if (dist >= n) continue; 
            int i = j - (int)dist;
            if (i >= 0 && a[i] == val) {
                ans++;
            }
        }
    }
    REP(i,n){
        if (a[i] > limit) {
            for (ll y = 1; ; ++y) {
                ll dist = (ll)a[i] * y;
                ll j_idx = i + dist;
                if (j_idx >= n) break;
                if (a[j_idx] == y) ans++;
            }
        }
    }
    cout << ans << "\n";
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    ll test=1;
    cin>>test;
    while(test--)
    {
        solve();
    }
    return 0;
}