/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 328.0 KiB
#2 Accepted 1ms 324.0 KiB
#3 Accepted 1ms 540.0 KiB
#4 Accepted 1ms 588.0 KiB
#5 Accepted 1ms 540.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
int32_t main() {
     ios_base::sync_with_stdio(false);
     cin.tie(0); cout.tie(0);

     int n; cin >> n;
     int a[n];
     for (int i = 0; i < n; i++) cin >> a[i];
     int ans = 0;
     for (int i = 0; i < n; i++) {
        for (int j = i+1; j < n; j++) {
            if ((a[i] * a[j]) % (a[i] + a[j]) == 0) ans++;
        }
     }
     cout << ans << "\n";

}

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:18:50
Judged At
2024-12-07 10:18:50
Judged By
Score
100
Total Time
2ms
Peak Memory
588.0 KiB