Here you can find my code for WSQ12:
https://github.com/finntec/wsq12.git
Para este WSQ sólo vi un video en youtube sobre el algoritmo de Euclid y lo demás lo deduje por lógica. Aquí está el código. El operador % ayudó bastante para simplificar la función. //WSQ12 #include <iostream> using namespace std; int gcd (int x, int y){ int yy; int xx; int z=1; while(z!=0){ xx=x; yy=y; […]
This is a program that calculates the greatest common denominator of two positive integers using Euclid’s algorithm. https://github.com/DianaJU/Write/blob/master/gcd.py
Fairly simple and short. Here’s the code: https://github.com/Dragv/wsq12/tree/master
GitHub code link
https://github.com/FernyAlanis/wsq11-17/blob/master/wsq12
Foto: https://flic.kr/p/sUJ9TM Estaba fácil y no tuve ningún problema en hacerlo. Aquí esta el link de mi código: https://github.com/BrayanGc/Codigos/blob/master/GCD.cpp
This one was really easy.
This task was quite easy, it was possible to do only reading about Euclid’s algorithm. Even in wikipedia. It was just taking both numbers and getting its module, then dividing the second number and the module, until the module was 0…. Continue Reading →