Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- -- pozadovane delky necht jsou serazene sestupne (jinak si setridis)
- -- navic existuje reseni (jinak potreba osetrit)
- rezani :: Int -> [Int] -> [[Int]]
- rezani _ [] = [[]]
- rezani d xs = udelane ++ (rezani d zbyle)
- where udelane = najdiJeden d xs
- zbyle = xs \\ udelane -- vrati doplnek prvniho seznamu do druheho
- -- rozreze jednu kladu co nejlepe a vrati seznam polinek, ktere z ni vyrobil
- najdiJeden :: Int -> [Int] -> [Int]
- najdiJeden 0 _ = []
- najdiJeden _ [] = []
- najdiJeden d x:xs = if (x<=d) x:(najdiJeden (d-x) xs)
- else najdiJeden d xs
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement