Учебные задачи

function :: Num i => [i] -> i -> [i] 
function [] _= []
function (x : xs) n = (n + x) : function xs n
 
-- или можно просто написать function = flip (map . (+))
 
task2 :: Num i => [i] -> [i] -> [i]
task2 (x : xs) (y : ys) = (x + y) : task2 xs ys
-- или можно просто написать task2 = zipWith (+) 
 
data Tree a = Leaf | Node (Tree a) a (Tree a)
 
treeSum :: Tree Integer -> Integer
treeSum = Leaf = 0
treeSum (Node l i r) = i + lh + rh where
    [lh, rh] = map treeSum [l, r]
 
 
treeHeight :: Tree a -> Int
treeHeight Leaf = 0
treeHeight (Node l _ r) = 1 + max lh rh where
    [lh, rh] = map treeHeight [l, r]

import System.IO
sum3lists [] = []
sum3lists (x:xs) = (x + 5) : sum3lists xs
 
main = do
    putStrLn "Please, Enter list format [2,7,1]"
    l1 <- getLine
    putStrLn $ show $ sum3lists (read l1)

import System.IO
 
sum3lists [] _ = []
sum3lists _ [] = []
sum3lists (x:xs) (y:ys) = (x+y) : sum3lists xs ys
 
main = do
       putStrLn "Please, enter the first list"
       l1 <- getLine
       putStrLn "Please, enter the second list"
       l2 <- getLine
       putStrLn $ show $ sum3lists (read l1) (read l2)

import Data.List
 
d:: Integer -> [Integer]
d n = [i| i <- [1..n], (n `mod` i) == 0]
primesSGT :: [Integer]
primesSGT = 2 : ops
    where
    ops = 3 : [n | (r:q:_, px) <- (zip . tails . (3 : ) . map (\x ->x*x)) ops (inits ops),
                   n <- [r+2,r+4..q-2],  all ((> 0) . rem n) px]
pd:: Integer -> [Integer]
pd n = [i| i <- takeWhile (<n) $ primesSGT,  (n `mod` i) == 0]
nd :: Integer -> Int 
nd = length . d
 
 
main::IO()
main = do
    let n = 6
    print "Natural number - "
    print n
    print "vsego natural delitelei"
    print $ nd n

task2 :: Num i => [i] -> [i] -> [i]
task2 (x : xs) (y : ys) = (x + y) : task2 xs ys
task2 _ _ = []

1.
import System.IO
sum3lists [] = []
sum3lists (x:xs) = (x + 5) : sum3lists xs
 
main = do
putStrLn "Please, Enter list format [2,7,1]"
l1 <- getLine
putStrLn $ show $ sum3lists (read l1)
 
-------------------------------------------------------
 
2.
import System.IO
 
sum3lists [] _ = []
sum3lists _ [] = []
sum3lists (x:xs) (y:ys) = (x+y) : sum3lists xs ys
 
main = do
putStrLn "Please, enter the first list"
l1 <- getLine
putStrLn "Please, enter the second list"
l2 <- getLine
putStrLn $ show $ sum3lists (read l1) (read l2)
 
-------------------------------------------------------
 
4.
import Data.List
 
d:: Integer -> [Integer]
d n = [i| i <- [1..n], (n `mod` i) == 0]
primesSGT :: [Integer]
primesSGT = 2 : ops
where
ops = 3 : [n | (r:q:_, px) <- (zip . tails . (3 : ) . map (\x ->x*x)) ops (inits ops),
n <- [r+2,r+4..q-2], all ((> 0) . rem n) px]
pd:: Integer -> [Integer]
pd n = [i| i <- takeWhile (<n) $ primesSGT, (n `mod` i) == 0]
nd :: Integer -> Int
nd = length . d
 
 
main::IO()
main = do
let n = 6
print "Natural number - "
print n
print "vsego natural delitelei"
print $ nd n

task4 :: Integral i => i -> Int
task4 n = length $ filter ((== 0) . (n `mod`)) [1..n]

treeSum = Leaf = 0