1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
|
/* Lcm (least common multiple), and gcd (greatest common divisor)
Copyright (C) 1996 Free Software Foundation, Inc.
Written by Miles Bader <miles@gnu.ai.mit.edu>
This file is part of the GNU Hurd.
The GNU Hurd is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2, or (at
your option) any later version.
The GNU Hurd is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
/* There are probably more efficient ways to do these... */
/* Return the greatest common divisor of p & q. */
inline long
gcd (long p, long q)
{
if (p == 0)
return q;
else if (q == 0)
return p;
else if (p == q)
return p;
else if (q > p)
return gcd (q, p);
else
return gcd (q, p % q);
}
/* Return the least common multiple of p & q. */
long
lcm (long p, long q)
{
return (p / gcd (p, q)) * q;
}
|
