POJ 2739

#include<iostream>
#include<stdio.h>
using namespace std;
const int maxp = 2000,n = 10000;
int a[maxp],current = 0;
bool isprime(int k){
    for (int i = 0; i < current; i++)
    {
        if(k%a[i] == 0)
            return false;
    }
    return true;
    
}
void complete(){
    for (int i = 2; i <= n; i++)
    {
        if (isprime(i))
        {
           a[current] = i;
           current++;
        }
        
    }
    
}
int main(){
    complete();
    int num;
    cin >> num;
    while (num)
    {
        int k = 0;
        for (int i = 0; num >= a[i]; i++)
        {
            int sum = 0;
            for (int j = i; j<current && sum<num ; j++)
            {
                sum += a[j];
                if (sum == num)
                    k++;
            }
        }
        cout<<k<<endl;
        cin>>num;
        
    }
}