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