One line of code to achieve gcd (greatest common divisor) and lcm (least common multiple)

int gcd(int x,int y){
    
    
	return y?gcd(y,x%y):x;
}

int lcm(int x,int y){
    
    
	return x*y/gcd(x,y);
}