Accepted
Code
#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
int n;cin>>n;
int arr[n];
for(int i=0;i<n;i++)cin>>arr[i];
int ans=0;
for(int i=0;i<n-1;i++)
{
for(int j=i+1;j<n;j++)
{
int prod = arr[i]*arr[j];
int sum = arr[i]+arr[j];
if(prod%sum==0)
{
//cout<<i<<" "<<j<<endl;
ans++;
}
}
}
cout<<ans<<endl;
}
int32_t main()
{
int t=1;
//cin>>t;
for(int i=1;i<=t;i++)
{
//cout<<"Case : "<<i;
solve();
}
}
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:37
- Judged At
- 2024-12-07 10:09:37
- Judged By
- Score
- 100
- Total Time
- 2ms
- Peak Memory
- 540.0 KiB