/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 496.0 KiB
#2 Accepted 1ms 540.0 KiB
#3 Accepted 2ms 516.0 KiB
#4 Accepted 2ms 584.0 KiB
#5 Accepted 1ms 328.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define PI acos(-1.0)
#define vi vector<ll>
#define pii pair<ll,ll>
#define vii vector<pii>
#define rsrt(a) sort(a.rbegin(),a.rend())
#define srt(a) sort(a.begin(),a.end())
#define rev_str(str) reverse(str.begin(),str.end());
#define print(v) for(auto i:v) cout<<i<<" ";cout<<endl;
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define rep(i,a,b) for(ll i =a ;i<b;i++)
#define per(i,b,a) for(ll i=b;i>=a;i--)
bool sortByValue(const pair<int,int>& a,const pair<int,int>& b){
    return a.second > b.second;
}

void solve(){
    ll n;cin>>n;
    vi p(n);
    rep(i,0,n) cin>>p[i];
    ll cnt=0;
    rep(i,0,n){
        rep(j,i+1,n){
            ll ki = p[i]*p[j];
            ll ji= p[i]+p[j];
            if(ki%ji==0){
                //cout<<ki<<endl;
                cnt++;
            } 
        }
    }
    cout<<cnt<<endl;
}
int main(){
    fast;
    ll t=1;//cin>>t;
    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:12:39
Judged At
2024-12-07 10:12:39
Judged By
Score
100
Total Time
2ms
Peak Memory
584.0 KiB