Range GCD Queries — Solution & Editorial
gcd is idempotent and associative like min — the same sparse-table trick answers queries with two overlapping power-of-two windows.
Complexity: O(N log N log V) build, O(log V) per query
gcd is idempotent and associative like min — the same sparse-table trick answers queries with two overlapping power-of-two windows.
Complexity: O(N log N log V) build, O(log V) per query