Problem 2183 · Hard

Count Array Pairs Divisible by K

Count pairs of array positions whose value product is divisible by k. The visual groups values by their gcd with k and matches complementary groups.

Open the interactive visualisation