定理:gcd(a,b)*lcm(a,b)=a*b;
更相损减术:gcd(a,b)=gcd(b,a-b)=gcd(a,a-b)
欧几里得算法:gcd(a,b)=gcd(b,a mod b)
复杂度O(log(a+b))
int gcd(int a,int b){return b?gcd(b,a%b):a;}
posted on 2019-01-07 12:51 zsben 阅读(114) 评论(0) 编辑 收藏 举报
Powered by: 博客园 Copyright © 2024 zsben Powered by .NET 8.0 on Kubernetes