Accepted
Code
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios ::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
int ans=0;
for(int i=0;i<n-1;i++)
{
for(int j=i+1;j<n;j++)
{
ll ab=v[i]*v[j];
ll s=v[i]+v[j];
if(ab%s==0)
{
ans++;
}
}
}
cout<<ans<<'\n';
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:09:24
- Judged At
- 2024-12-07 10:09:24
- Judged By
- Score
- 100
- Total Time
- 2ms
- Peak Memory
- 768.0 KiB