/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 776.0 KiB
#2 Accepted 2ms 540.0 KiB
#3 Accepted 1ms 540.0 KiB
#4 Accepted 2ms 344.0 KiB
#5 Accepted 2ms 540.0 KiB

Code

#include <iostream>
using namespace std;

int main()
{
    int n;
    cin >> n;
    int arr[n];
    for (int i = 0; i < n; i++)
        cin >> arr[i];

    int cnt = 0;
    for (int i = 0; i < n; i++)
    {
        for (int j = i + 1; j < n; j++)
        {
            if (arr[i] * arr[j] % (arr[i] + arr[j]) == 0)
            {
                cnt++;
            }
        }
    }
    cout << cnt << 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 10:13:38
Judged At
2024-12-07 10:13:38
Judged By
Score
100
Total Time
2ms
Peak Memory
776.0 KiB