function gcd(a, b)
if b =
return a
else
return gcd(b, a mod b)
相关文章
- find the greatest common divisor
- HDOJ 1423 Greatest Common Increasing Subsequence -- 动态规划
- LCIS POJ 2172 Greatest Common Increasing Subsequence
- HDU4512完美队形I && HDU1423 Greatest Common Increasing Subsequence (LCIS)
- HDOJ 1423 Greatest Common Increasing Subsequence 【DP】【最长公共上升子序列】
- codeforces#505--B Weakened Common Divisor
- leetcode 1071 Greatest Common Divisor of Strings
- 845. Greatest Common Divisor
- greatest common divisor
- LeetCode 1071. 字符串的最大公因子(Greatest Common Divisor of Strings) 45