Accepted
Code
#include<bits/stdc++.h>
using namespace std;
const long long M=2e6+10,MOD=1000000007;
typedef long long ll;
int fre[M];
int limit=2e6;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int t=1;
// cin>>t;
while(t--){
int n;
cin >>n;
int ans=0;
vector<ll>a(n+1);
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
ans+=((a[i]*a[j])%(a[i]+a[j])==0);
}
}
cout<<ans<<"\n";
}
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1131 Count Special Pairs
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2024-11-04 15:07:04
- Judged At
- 2024-12-17 11:26:08
- Judged By
- Score
- 100
- Total Time
- 1ms
- Peak Memory
- 536.0 KiB