import System.IO import Data.Time import Data.List maxfloor 1 m = m maxfloor n m = sum.map ((+1).maxfloor (n-1)) $ [0..m-1] maxfloor' n m | m <= 0 = 0 | n <= 0 = 0 | n == 1 = m | m < n = maxfloor' m m | otherwise = maxfloor' n (m-1) + maxfloor' (n-1) (m-1) + 1 task f n k = until ((>=k).f n) (+1) 0 testtask s f n k = do begT <- getCurrentTime putStrLn $ s ++ ": n = " ++ show n ++ ", k = " ++ show k ++ " : res = " ++ show (task f n k) endT <- getCurrentTime putStrLn $ show $ diffUTCTime endT begT maxfloor3 m = m*(m^2+5) `div` 6 main = do print $ nub.map (\i -> maxfloor 3 i - maxfloor3 i) $ [1..700] --testtask "Ivana" maxfloor 10 (2^23) --testtask "gng" maxfloor' 7800000 7800000