Accepted
Code
#include<bits/stdc++.h>
using namespace std;
bool isPair(int i, int j){
if((i*j)%(i+j) == 0){
return true;
}
return false;
}
int main(){
int n;
cin >> n;
vector<int> arr(n);
vector<int> arrCopy(n);
for (int i = 0; i < n; ++i)
{
cin >> arr[i];
}
arrCopy = arr;
int count = 0;
for (int i = 0; i < n; i++)
{
for (int j = i+1; j < n; j++)
{
if(isPair(arrCopy[i], arrCopy[j])){
count++;
}
}
}
cout << count << endl;
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 11:46:05
- Judged At
- 2024-12-07 11:46:05
- Judged By
- Score
- 100
- Total Time
- 2ms
- Peak Memory
- 576.0 KiB