/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 556.0 KiB
#2 Accepted 1ms 576.0 KiB
#3 Accepted 2ms 456.0 KiB
#4 Accepted 1ms 540.0 KiB
#5 Accepted 1ms 540.0 KiB

Code

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

bool isPair(int i, int j){
	
		if((i*j)%(i+j) == 0){
			return true;
		}
		
	
	return false;
}

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

	arrCopy = arr;
	int count = 0;
	
	for (int i = 0; i < n; i++)
	{
		for (int j = i+1; j < n; j++)
		{
			if(isPair(arrCopy[i], arrCopy[j])){
				count++;
			}
		}
		
	}

	cout << count << 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 11:46:05
Judged At
2024-12-07 11:46:05
Judged By
Score
100
Total Time
2ms
Peak Memory
576.0 KiB