Aplicacion MCD

From OLPC
Revision as of 05:57, 6 June 2008 by DanielAjoy (talk | contribs)
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Nivel

???

Actividades

Activity-turtleart.svg

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