题目1438：最小公倍数（利用最大公倍数求解）

题目链接：http://ac.jobdu.com/problem.php?pid=1438

 

详解链接：https://github.com/zpfbuaa/JobduInCPlusPlus

 

参考代码：

//
//  1438 最小公倍数.cpp
//  Jobdu
//
//  Created by PengFei_Zheng on 10/04/2017.
//  Copyright © 2017 PengFei_Zheng. All rights reserved.
//
 
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <cmath>
 
using namespace std;
 
int gcd(int a, int b){
    if(b==0) return a;
    else return gcd(b,a%b);
}
 
int a, b;
 
int main(){
    while(scanf("%d%d",&a,&b)!=EOF){
        if(a==0 && b==0) break;
        printf("%d\n",a*b/gcd(a,b));
    }
}
/**************************************************************
    Problem: 1438
    User: zpfbuaa
    Language: C++
    Result: Accepted
    Time:0 ms
    Memory:1520 kb
****************************************************************/