GuardMarket

math.gcd

最大公约数

Return the nonnegative greatest common divisor of two bounded integers.

Version 1.0.0确定性数据处理Backend required

使用场景 / Purpose

Math: gcd. 本技能对提供的参数执行计算,输入输出契约如下。文档例子来自已实现函数的固定验收样例;网页本身不执行代码。

输入字段 / Parameters

字段类型要求约束与说明
a"integer"必填 Required{"minimum": -1000000, "maximum": 1000000}
b"integer"必填 Required{"minimum": -1000000, "maximum": 1000000}

输入例子 / Example input

{
  "a": 48,
  "b": 18
}

预期输出 / Expected output

6
完整输入 JSON Schema
{
  "type": "object",
  "properties": {
    "a": {
      "type": "integer",
      "minimum": -1000000,
      "maximum": 1000000
    },
    "b": {
      "type": "integer",
      "minimum": -1000000,
      "maximum": 1000000
    }
  },
  "required": [
    "a",
    "b"
  ],
  "additionalProperties": false,
  "maxProperties": 1000
}
完整输出 JSON Schema
{
  "type": "number",
  "minimum": -1e+100,
  "maximum": 1e+100
}