GCD/LCM - GCD and LCM of two positive integers / HP-35s

for the HP 35s
GCD/LCM - Greatest common divisor and least common multiple of two positive integers

Input

REG Y: Positive integer N
REG X: Positive integer M

Output

REG T: Positive integer N
REG Z: Positive integer M
REG Y: LCM (Least common multiple)
REG X: GCD (Greatest common divisor)

Program list

GCDLCM - Rev.1.0 : Jan. 24 2012


G001>LBL G
G002 ENTER
G003 ENTER
G004 R↑
G005 ENTER
G006 R↑
G007 RMDR
G008 LASTx 
G009 X<>Y
G010 X≠0?
G011 GTO G007 
G012 +
G013 R↓
G014 ×
G015 LASTx 
G016 X<>Y
G017 R↑
G018 ÷
G019 LASTx 
G020 RTN