17 lines
367 B
Text
17 lines
367 B
Text
|
include c:\cxpl\codes;
|
||
|
|
|
||
|
|
func GCD(M,N); \Return the greatest common divisor of M and N
|
||
|
|
int M, N;
|
||
|
|
int T;
|
||
|
|
[while N do \Euclid's method
|
||
|
|
[T:= M; M:= N; N:= rem(T/N)];
|
||
|
|
return M;
|
||
|
|
];
|
||
|
|
|
||
|
|
func LCM(M,N); \Return least common multiple
|
||
|
|
int M, N;
|
||
|
|
return abs(M*N) / GCD(M,N);
|
||
|
|
|
||
|
|
\Display the LCM of two integers entered on command line
|
||
|
|
IntOut(0, LCM(IntIn(8), IntIn(8)))
|