In esProc, compute the greatest common divisor of any two numbers.

Solution:

A | B | C | |

1 | 12345678 | 765432 | |

2 | >small=A1 | >big=B1 | |

3 | if small>big | >small=B1 | |

4 | >big=A1 | ||

5 | for small>0 | =big%small | |

6 | >big=small | ||

7 | >small=B5 | ||

8 | =big |

The result of A8 is shown below: