/ SeriousOJ /

Record Detail

Accepted


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

Code

#include<bits/stdc++.h>
using namespace std;

#define int long long
#define endl "\n"
#define pii pair<int, int>
#define int long long


void solve() {
    int n; cin>>n;
    vector<int> v(n);
    for(auto &x : v) cin>>x;

    int cnt = 0;

    for(int i = 0; i < n; i++) {
        for(int j = i + 1; j < n; j++) if((v[i] * v[j]) % (v[i] + v[j]) == 0) {
            cnt += 1;
        }
    }

    cout<<cnt<<endl;
}


signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int t = 1; //cin>>t;
	for(int i = 1; i <= t; i++) {
		// cerr<<"Case "<<i<<": \n";
		solve();
	}
}

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:06:01
Judged At
2024-12-07 10:06:01
Judged By
Score
100
Total Time
1ms
Peak Memory
796.0 KiB