
The WSQ12 asked me to do a program that calculatesthe gcm, which is the greatest common divisor, the largest number that both number had as divisor. It asked to use the algorithm of a greek guy named Euclidean, so I entered wikipedia, the best site … Continúa leyendo WSQ12: GCD, Easy when done![]()


