Good Pairs

CodeChefRating 1248Open on judge ↗

You are given an array $A$ of length $N$. A pair $(i, j)$ $(1\le i\lt j \le N)$ is said to be *good* if $gcd(A_i, A_j) = lcm(A_i, A_j)$. Here $gcd$ denotes the [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor) and $lcm$ denotes [least common multiple](https://en.wikipedia.org/wiki/Least_common_multiple). Find the total number of *good* pairs present in the given a

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI