⇤ ← Версия 1 от 2019-11-27 12:41:54
357
Комментарий:
|
← Версия 2 от 2019-11-27 12:42:24 ⇥
353
|
Удаления помечены так. | Добавления помечены так. |
Строка 13: | Строка 13: |
Function can be like this: `def nod(a,b): return a if b==0 else nod(b, a%b)`, but not on the Python :) . | Function can be like this: `def nod(a,b): return a if b==0 else nod(b, a%b)`, but not on Python :) . |
Write a program that inputs two numbers and output its' Greatest_common_divisor. You must write a recursive subroutine gcd to complete this task.
2467080 49360080
9240
Function can be like this: def nod(a,b): return a if b==0 else nod(b, a%b), but not on Python .