HDOJ 1108 最小公倍数

HDACM1108
此题思路：先求两个数的最大公约数，则最小公倍数–>a*b/gcd(a,b);

import java.util.Scanner;public class Main{    public static void main(String[] args) {        Scanner sc = new Scanner(System.in);        while (sc.hasNext()) {            int a = sc.nextInt();            int b = sc.nextInt();            System.out.println(a/gcd(a, b)*b);        }    }    public static int gcd(int a,int b){        int s = 1;        for (int i = 2; i <= (a<b?a:b); i++) {            if (a%i==0&&b%i==0) {                s=i;            }        }        return s;    }}