Status: IN
The inner loop `j in range(i + 1, n)` ensures each unordered pair `(i, j)` is visited exactly once with `i < j` always satisfied, preventing duplicates by construction.
Source: entries/2026/06/06/count-equal-and-divisible-pairs-in-an-array-solution.md