- CHANGELOG.md:v2.8.0 条目(中英双语); - README.md:版本行 2.7.1→2.8.0 + 愿景第 6 条(知识可证明); - doc/releases/v2.8.0.md:双语发版说明(亮点/用法/已知限制); - skills/marqdo-dev/index.mq.md:新增 prove 任务(路径/目录模式/ require_lean/json;参数用 + 行声明升参,check 与 narrative-ratio 通过); - 设计文档 §12.5 标记已合入;发版链接统一指向 doc/releases/v2.8.0.md。
744 B
Executable File
744 B
Executable File
Task: qb_gcd (easy) — Greatest Common Divisor
Implement Greatest Common Divisor as a function named gcd in a Marqdo .mq.md program (Euclidean algorithm).
Requirements
- Function name
gcd, taking two integer parameters and returning their greatest common divisor (non-negative;gcd(0, 5)is5). - In
# main, hardcode the demo calls below and print each result on its own line — exactly four lines, no labels.
Demo calls (hardcode)
gcd(48, 18)gcd(1071, 462)gcd(0, 5)gcd(17, 5)
Expected output (self-check)
Four lines:
6
21
5
1
Deliverable
Write the program as a Marqdo .mq.md file. Return the complete source in a single ```markdown fence — no prose outside the fence.