Problem:
Problem A: Sum of Consecutive Prime Numbers

Some positive integers can be represented by a sum of one or more consecutive prime numbers.
How many such representations does a given positive integer have? For example, the integer 53
has two representations 5 + 7 + 11 + 13 + 17 and 53. The integer 41 has three representations
2 + 3 + 5 + 7 + 11 + 13, 11 + 13 + 17, and 41. The integer 3 has only one representation, which is
3. The integer 20 has no such representations. Note that summands must be consecutive prime
numbers, so neither 7 + 13 nor 3 + 5 + 5 + 7 is a valid representation for the integer 20.

Your mission is to write a program that reports the number of representations for the given
positive integer.

Input

The input is a sequence of positive integers each in a separate line. The integers are between 2
and 10 000, inclusive. The end of the input is indicated by a zero.

Output

The output should be composed of lines each corresponding to an input line except the last zero.
An output line includes the number of representations for the input integer as the sum of one
or more consecutive prime numbers. No other characters should be inserted in the output.

Sample Input

2
3
17
41
20
666
12
53
0

Output for the Sample Input

1
1
2
3
0
0
1
2

Solution in Haskell (judge verdict: Accepted)

import Control.Applicative ((<$>))
import Control.Monad (unless)
import Data.List (unfoldr)

main :: IO ()
main = do
  n <- readLn
  unless (n == 0) $ do
    print $ solve n
    main

solve :: Int -> Int
solve n = f 0 0 ls ls
  where ls = takeWhile (<= n) ps
        f ct sm [] [] = ct
        f ct sm (x:xs) [] | sm < n = ct
                          | sm == n = f (ct+1) (sm-x) xs []
                          | otherwise = f ct  (sm-x) xs []
        f ct sm (x:xs) (y:ys) | sm < n = f ct (sm+y) (x:xs) ys
                              | sm == n = f (ct+1) (sm-x) xs (y:ys)
                              | otherwise = f ct (sm-x) xs (y:ys)

ps :: [Int]
ps = 2 : unfoldr f 3
  where f x | x == 0 = Nothing
            | isP x = Just (x, x+2)
            | otherwise = f (x+2)

isP :: Int -> Bool
isP x = all ((/=0).(mod x)) . takeWhile ((<= x).(^2)) $ ps