Toggle navigation
GoHackOJ
F.A.Qs
Web Board
ProblemSet
Source/Category
Status
Ranklist
Contest
Login
Language
中文
ئۇيغۇرچە
English
فارسی
ไทย
한국어
Problem1794--最大公约数(gcd)
1794: 最大公约数(gcd)
[Creator :
]
Time Limit :
1.000
sec
Memory Limit :
128 MB
Solved: 2
Submit: 4
Statistics
Description
用递归辗转相除法计算正整数n和m的最大公约数g
Input
输入:n m
输出:gcd=g
Output
2 3
Sample Input
Copy
gcd=1
Source/Category
递归