UVa 1213 - Sum of Different Primes

// UVa 1213 - Sum of Different Primes
// 0-1 Knapsack (Subset Sum)

#include <iostream>
#include <string.h>
using namespace std;

const int primes[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179,
		181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401,
		409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643,
		647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907,
		911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117 };

const int MAX_N = 1120;
const int MAX_K = 14;

const int primeCount = (sizeof(primes) / sizeof(*primes));

int main() {

	int n, k;
	while (cin >> n >> k && n && k) {

		int T[MAX_K + 1][MAX_N + 1];
		memset(T, 0, sizeof(T));
		T[0][0] = 1;

		for (int p = 0; p < primeCount; p++) {
			int prime = primes[p];
			if (prime > n)
				break;
			for (int i = n - prime; i >= 0; i--)
				for (int j = k - 1; j >= 0; j--)
					if (T[j][i])
						T[j + 1][i + prime] += T[j][i];
		}
		cout << T[k][n] << endl;
	}
	return 0;
}