Lcm Using Gcd(euclid)(optimal Method)

class Main { public static void lcm(int A ,int B) { int a =A; int b=B; int gcd=1; int lcm; int product=a*b; while(a!=0) { int a_=b%a; int b_=a; a=a_; ...