-
Recent Posts
Recent Comments
Archives
Categories
Meta
Tag Archives: #wsq12
WSQ12 – Greatest Common Divisor
Comments Off on WSQ12 – Greatest Common Divisor
Posted in Blogs, Syndicated, TC1017 Blogs
WSQ12
WSQ12. Greatest Common Divisor
Github Link: https:/
WSQ12 – Greatest Common Divisor
Comments Off on WSQ12 – Greatest Common Divisor
Posted in Blogs, Syndicated, TC1014 Blogs
Maximo Comun Divisor
“El máximo común divisor (m.c.d. o mcd) de dos o más números es el mayor número que divide a todos exactamente.
Cálculo del máximo común divisor
1 Se descomponen los números en factores primos.
2 Se toman los factores comunes con menor exponente.
3 Se multiplican dichos factores y el resultado obtenido es el mcd.”(Vitutor)
Este es el proceso para poder obtener el maximo comun divisor, pero ¿como se puede hacer esto en una computadora? Pues con una funcion especifica que pueda ser esto, y aqui esta mi ejemplo:https:/
#Tc1017#WSQ12
Pagina donde puedes ver mas informacion acerca del maximo comun divisor: http:/
Comments Off on Maximo Comun Divisor
Posted in Blogs, Syndicated, TC1017 Blogs
Greatest Common Divisor #WSQ12 #TC1014
Finished the WSQ12.
Pretty easy though, not a single problem and it ran at the first try.
Code: https:/
Comments Off on Greatest Common Divisor #WSQ12 #TC1014
Posted in Blogs, Syndicated, TC1014 Blogs
Hey gusy here is my WSQ12
Here is the link on github: https:/
Comments Off on Hey gusy here is my WSQ12
Posted in Blogs, Syndicated, TC1014 Blogs
#WSQ12
For this program I had to calculate the greatest common divisor of two possitive integers, to do this we implemented Euclidean Algorithm, if you want to know more about this you can check this link: http:/
I think that this program is really simple, because you only need to evaluate each case and apply the formula.
For this program I think that is useful to know something about functions, because you can implement them and have a program more organized.
Here you can see my code and the program working.
Also you can find my code here:
GitHub: https:/
Google Drive: https:/
WSQ12
#WSQ12 this code is kind of different, but it works the same
code in github:
https:/
#WSQ12
This #wsq12 actually i already had it done because of the quiz we did but making a program that gives you the greates common divisor in c++ is pretty easy, you just got to know well what a greates common divisor is, understand it, and how to use loops and conditionals.
My link to dropbox cause my github isn´t working in my computer.
https:/
WSQ12
WSQ12
in this wsq i just made a funcion that can return the gcd, its very short my program so i cant say much
here is my wsq https://github.com/juanheuforico/WSQ/blob/master/WSQ12.py
