From f887eea109e48f8df5df91e50998fc4e3e5d1ee4 Mon Sep 17 00:00:00 2001 From: Augusto Date: Wed, 24 Apr 2019 12:26:04 +0100 Subject: [PATCH] change hcd to gcd for consistency --- subjects/gcd.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/subjects/gcd.md b/subjects/gcd.md index 3cf126ae..9d1a509e 100644 --- a/subjects/gcd.md +++ b/subjects/gcd.md @@ -4,7 +4,7 @@ Write a program that takes two strings representing two strictly positive integers that fit in an int. -Display their highest common denominator followed by a newline (It's always a +Display their greatest common divisor followed by a newline (It's always a strictly positive integer). If the number of parameters is not 2, display a newline.