Haskell程序：求两个数的最小公倍数

main :: IO()
main = do
-- declaring and initializing variables
   let a = 10
   let b = 23
-- print the lcm by invoking the inbuilt function lcm
   putStr("LCM of "++ (show a) ++ " and "++ (show b) ++" is:")
   print (lcm a b)

-- function declaration
lcm2 :: Int->Int->Int
-- function definition
lcm2 a b = head [x|x<-[1..(a*b)],(mod x a)==0,(mod x b)==0]

main :: IO()
main = do
   let a = 10
   let b = 23
-- displaying the output returned from function lcm2
   putStr("LCM of "++ (show a) ++ " and "++ (show b) ++" is:")
   print (lcm2 a b)

-- function declaration
lcm3 :: Int->Int->Int->Int
-- function definition
lcm3 a b c = if ((mod c a)==0&&(mod c b)==0)
   then c
   else lcm3 a b (c+1)

main :: IO()
main = do
   let a = 10
   let b = 40
-- printing the output by invoking lcm3 function
   putStr("LCM of "++ (show a) ++ " and "++ (show b) ++" is:")
   print (lcm3 a b 1)

-- function declaration
hcf :: Int->Int->Int

-- function definition
hcf a 0 = a
hcf a b = hcf b (mod a b)

-- function declaration
lcm4 :: Int->Int->Int
-- function definition
lcm4 a b = div (a*b) (hcf a b)

main :: IO()
main = do
   let a = 10
   let b = 25
-- printing the output by invoking the lcm4 function
   putStr("LCM of "++ (show a) ++ " and "++ (show b) ++" is:")
   print (lcm4 a b)

main :: IO()
main = do
   let a = 10
   let b = 23
-- print the lcm by invoking the inbuilt function gcd
   putStr("LCM of "++ (show a) ++ " and "++ (show b) ++" is:")
   print (div (a*b) (gcd a b))