August 19, 2024
Use Euclid's algorithm.
Example:* (gcd 36 63)9
lisp
;;; Retorna o maximo divisor comum
(defun my-gcd (m n)
(if (= n 0)
m
(my-gcd n (mod m n))
)
)
Practice makes perfect! Sharpen your coding skills with our collection of 99 programming problems, ranging from beginner-friendly challenges to advanced brain teasers. Whether you're a seasoned developer or just starting out, our problems will help you improve your coding abilities and prepare you for technical interviews.
Don't have an account? We will create one for you.
Enter the OTP send to
in seconds. Check your spam folder if you can't find email from us.
Valid email is required for further communications