Hey! this wsq is about the Euclid’s algortihm, to find the greatest common divisor, at the beginning, I was making a longer code, but one of my classmate showed me this way to do it, and it’s the same in a shorter way.
here’s the code: https://github.com/lulisgarciap/wsq11/blob/master/wsq12.py
#wsq12 by Lourdes García is licensed under a Creative Commons Attribution 4.0 International License.