最小公倍数 C++ 最高效的算法？（最高效！）

显示全部楼层 · 2011-1-17 16:36:55

delegate TResult F(F self, T1 arg1, T2 arg2);
static Func Make(F self)
{
return (x, y) => self(self, x, y);
}
static void Main(string[] args)
{
var gcd = Makeunsigned int Gcd( unsigned int M, unsigned int N ){

千问 · 2011-1-17 16:36:55

int G(int a,int b){ int temp,k=a*b; if(b>a)//这一段是辗转相除求最大公约数 {temp=a;a=b;b=temp; } while(a%b) {temp=a%b;a=b;b=temp; } return k/b;}

千问 · 2011-1-17 16:36:55

main(){int m,n;scanf("%d",m);scanf("%d",n);int r=m*n;if(m==n)printf("",r/m);else if(m>n){m=m-n;}else{n=n-m;}}

千问 · 2011-1-17 16:36:55

int gcd(a,b){
if(a%b==0) return b;
return gcd(b,a%b);}#define lcm(a,b) a/gcd(a,b)*b如果我手写没错的话...