Accepted
Code
#include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base :: sync_with_stdio (0); cin.tie(0); cout.tie(0);
int main()
{
optimize();
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; i++)
{
for(int j = i+1; j<n; j++)
{
int a = v[i]*v[j];
int b = v[i]+v[j];
if(a%b==0)ans++;
}
}
cout<<ans;
}
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:17:09
- Judged At
- 2024-12-07 10:17:09
- Judged By
- Score
- 100
- Total Time
- 2ms
- Peak Memory
- 540.0 KiB