设计一个算法，求输入正整数A和正整数B的最小公倍数。

package com.test.xml;

import java.util.Scanner;

public class LeastCommonNumber {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while (in.hasNext()) {
int a = in.nextInt();
int b = in.nextInt();
<span style="color:#FF0000;">			int result = a * b / foo(a, b);</span>
System.out.println(result);
}
}

public static int foo(int a, int b) {
int c = a % b;
if (c == 0) {
return b;
} else {
return foo(b, c);
}
}
}