aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Initial data commit

Browse source
This commit is contained in:
Ingy döt Net 2023-07-01 11:58:00 -04:00
parent 72d218235f
commit f23f22d71c
199087 changed files with 3378941 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

16
Task/Least-common-multiple/XPL0/least-common-multiple.xpl0 Normal file
View file

@ -0,0 +1,16 @@
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)))