Skip to content

[tool] gcd #209

Description

@github-actions

Tool Request

Description: Finds the greatest common divisor of two integers

Signature

run(a: str, b: str) -> str

Example
gcd "12" "8" -> "4"


This issue was auto-generated. Pick it up by commenting below!

Metadata

Metadata

Labels

Projects

No projects

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests

Issue actions