Initializing help system before first use

Largest common divisor
Type: Programming
Rating: 2 (easy-medium)
Description: Find the largest common divisor of two integer numbers
  • recursive function calls
  • if-then-elif-then-else statement
  • alternative formulation using a 'while' loop
File(s): lcdiv1.mos

lcdiv1.mos
(!******************************************************
   Mosel User Guide Example Problems
   ================================= 

   file lcdiv1.mos 
   ``````````````` 
   Using the `while` loop.
 
   (c) 2008 Fair Isaac Corporation
       author: S. Heipcke, 2001, rev. Jun. 2022
*******************************************************!)

model Lcdiv1

 declarations
  A,B: integer
 end-declarations

 write("Enter two integer numbers:\n  A: ")
 readln(A)
 write("  B: ")
 readln(B)

 while (A <> B) do
   if A>B then 
     A:=A-B 
   else B:=B-A 
   end-if
 end-do

 writeln("Largest common divisor: ", A)

end-model
Parent Topic Flow control constructs

© 2001-2024 Fair Isaac Corporation. All rights reserved. This documentation is the property of Fair Isaac Corporation (“FICO”). Receipt or possession of this documentation does not convey rights to disclose, reproduce, make derivative works, use, or allow others to use it except solely for internal evaluation purposes to determine whether to purchase a license to the software described in this documentation, or as otherwise set forth in a written software license agreement between you and FICO (or a FICO affiliate). Use of this documentation and the software described in it must conform strictly to the foregoing permitted uses, and no other use is permitted.