Aplicacion MCD: Difference between revisions
Jump to navigation
Jump to search
DanielAjoy (talk | contribs) No edit summary |
DanielAjoy (talk | contribs) |
||
| Line 22: | Line 22: | ||
fijar.xy coory ( coorx mod coory ) |
fijar.xy coory ( coorx mod coory ) |
||
pila1 |
pila1 |
||
[[Image:MaximoComunDivisorEnTortugArte.png|600px]] |
|||
Revision as of 03:39, 22 September 2010
Nivel
???
Actividades
Descripción
Maximo Común Divisor de dos números, utilizando el algoritmo de Euclides. Por ejemplo, el MCD de 360 y 100 sale 20.
sinpluma fijar.xy 360 100 pila1 pila1 si coory = 0 [ mostrar coorx detener.pila ] fijar.xy coory ( coorx mod coory ) pila1
