题目链接:点击进入
题目
题意
长度为 n 的数组 a ,求满足 i < j && a [ i ] * a [ j ] == i + j 的( i , j )对数。
思路
枚举 sum = i + j ,对于每个 sum 质因子分解,对于每个因子 q , 判断 q 以及 sum / q 是否存在 ,同时判断两者对应的坐标相加是否等于 sum 。
代码
// Problem: B. Pleasant Pairs
// Contest: Codeforces - Codeforces Round #728 (Div. 2)
// URL: https://codeforces.com/contest/1541/problem/B
// Memory Limit: 256 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
//#pragma GCC optimize(3)//O3
//#pragma GCC optimize(2)//O2
#include<iostream>
#include<string>
#include<map>
#include<set>
//#include<unordered_map>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<fstream>
#define X first
#define Y second
#define best 131
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define lowbit(x) x & -x
#define inf 0x3f3f3f3f
//#define int long long
//#define double long double
//#define rep(i,x,y) for(register int i = x; i <= y;++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pai=acos(-1.0);
const int maxn=1e6+10;
const int mod=998244353;
const double eps=1e-9;
const int N=1e6+10;
/*--------------------------------------------*/
inline int read()
{
int k = 0, f = 1 ;
char c = getchar() ;
while(!isdigit(c)){if(c == '-') f = -1 ;c = getchar() ;}
while(isdigit(c)) k = (k << 1) + (k << 3) + c - 48 ,c = getchar() ;
return k * f ;
}
/*--------------------------------------------*/
int t,n,a[maxn];
int v[maxn];
int main()
{
// ios::sync_with_stdio(false);
// cin.tie(0);cout.tie(0);
cin>>t;
while(t--)
{
int ans=0;
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i],v[a[i]]=i;
for(int i=3;i<=2*n-1;i++)
{
for(int j=1;j*j<i;j++)
{
if(i%j!=0) continue;
int tmp=i/j;
if(v[tmp]&&v[j]&&v[tmp]+v[j]==i)
ans++;
}
}
cout<<ans<<endl;
for(int i=1;i<=2*n;i++) v[i]=0;
}
return 0;
}