Submission #5410018

---

Source Code Expand

import qualified Control.Monad as M
import qualified Data.Map as Map
import qualified Data.Set as S
import qualified Data.Array as A

type IntSet = S.Set Int

main = do
    n <- readLn :: IO Int
    ps <- map read . words <$> getLine
    print $ solve n ps

solve :: Int -> [Int] -> Int
solve n ps = length $ g ps

g :: [Int] -> IntSet
g (p:[]) = S.fromList [0, p]
g (p:ps) = S.union s (S.map (+p) s) where
    s = g ps

Submission Info

Judge Result