Submission #1241464

---

Source Code Expand

import Data.List

main = do
    n <- readLn
    print $ solve n `mod` (10^9 + 7)

solve :: Integer -> Integer
solve n = product $ map (+1) $ factor [2..n]

factor :: [Integer] -> [Integer]
factor = map (fromIntegral . length) . group . sort . concatMap factors

factors :: Integer -> [Integer]
factors n | n <= 1 = []
          | null xs = [n]
          | otherwise = let x = head xs
                         in x : factors (n`div`x)
    where m = floor $ sqrt $ fromIntegral n
          ps = [2..m]
          xs = filter (\p -> n `mod` p == 0) ps

Submission Info

Judge Result