Greatest common divisor: Difference between revisions
Content added Content deleted
m (foundation page) |
(Forth is usually case-insensitive) |
||
| Line 23: | Line 23: | ||
The gcd of +33 and +77 is +11 |
The gcd of +33 and +77 is +11 |
||
The gcd of +49865 and +69811 is +9973 |
The gcd of +49865 and +69811 is +9973 |
||
=={{header|Forth}}== |
|||
: gcd ( a b -- n ) |
|||
begin dup while tuck mod repeat drop ; |
|||
Revision as of 13:23, 17 December 2007
You are encouraged to solve this task according to the task description, using any language you may know.
This task requires the finding of the greatest common divisor of two integers.
ALGOL 68
PROC gcd = (INT a, b) INT: (
IF a = 0 THEN
b
ELIF b = 0 THEN
a
ELIF a > b THEN
gcd(b, a MOD b)
ELSE
gcd(a, b MOD a)
FI
);
main : (
INT a = 33, b = 77;
printf(($x"The gcd of"g" and "g" is "gl$,a,b,gcd(a,b)));
INT c = 49865, d = 69811;
printf(($x"The gcd of"g" and "g" is "gl$,c,d,gcd(c,d)))
)
The output is:
The gcd of +33 and +77 is +11 The gcd of +49865 and +69811 is +9973
Forth
: gcd ( a b -- n ) begin dup while tuck mod repeat drop ;