/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 1ms 540.0 KiB
#3 Accepted 1ms 540.0 KiB
#4 Accepted 1ms 592.0 KiB
#5 Accepted 2ms 492.0 KiB

Code

#include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define print(v) for(auto data : v) cout << data << " "; cout << endl;
using namespace std;
void solve()
{
    int n; cin >> n;
    vector<int> v(n); for(auto &data : v) cin >> data;
    //print(v);
    int cnt = 0;
    for(int i = 0; i<n-1 ; i++)
    {
        for(int j = i+1; j<n; j++)
        {
            if (((v[i] * v[j]) % (v[i] + v[j])) == 0) cnt++;
            //if(v[i] * v[j] % v[i] + v[j] == 0) cnt++;
        }
    }
    cout << cnt << endl;
}
int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    //int t; cin >> t;
    int t = 1;
    while(t--) solve();

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