Accepted
Code
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
int n; cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++) cin>>v[i];
int cnt = 0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
int p = v[i]*v[j];
int s = v[i]+v[j];
if(p%s==0) ++cnt;
}
}
cout<<cnt<<endl;
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1131 Count Special Pairs
- Contest
- LU IUJPC : Sylhet Division 2024, Mock Round
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2024-12-07 10:04:33
- Judged At
- 2024-12-07 10:04:33
- Judged By
- Score
- 100
- Total Time
- 1ms
- Peak Memory
- 772.0 KiB