Problemintro
Range GCD query
Also called range gcd.
Return the greatest common divisor of a subarray; gcd is idempotent, so sparse tables apply.
Return the greatest common divisor of a subarray; gcd is idempotent, so sparse tables apply.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag CS857V Edit this page History Report an error