/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 540.0 KiB
#2 Accepted 2ms 328.0 KiB
#3 Wrong Answer 2ms 688.0 KiB

Code

#include<iostream>
#define ll long long
using namespace std;
int main(){

   ll N; cin>>N;
   ll arr[N];
   ll count=0;
   for(ll i=0;i<N;i++){
    cin>>arr[i];
   }
   for(ll i=0;i<N;i++){
    for(ll j=1;j<N;j++){
        ll mul=i*j;
        ll sum=i+j;
        if(mul%sum==0){
            count++;
        }
    }
   }
   cout<<count;

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 11:45:19
Judged At
2024-12-07 11:45:19
Judged By
Score
20
Total Time
2ms
Peak Memory
688.0 KiB