GreatestCommonDivisor(int a, int b)
{
int before_number , after_number;
int flag = 0;
int temp;
int greatest_common_divisor, lease_common_multiple;
before_number = a > b ? a : b;
after_number = a < b ? a : b;
while(!flag)
{
temp = before_number % after_number;
before_number = after_number;
after_number = temp;
if( after_number == 0)
{
flag = 1;
}
}
greatest_common_divisor = before_number;
lease_common_multiple= a * b / before_number;
}
void main()
{
GreatestCommonDivisor( 25, 30 );
}