greatest_common_divisor
Computes the greatest common divisor (GCD) of two non-negative integers using the Euclidean algorithm. (cost: 1 credit)
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| a | No | integer, required, the first non-negative integer | |
| b | No | integer, required, the second non-negative integer |