Zoj 2822 Sum of Different Primes (01 backpack)

Zoj 2822 Sum of Different Primes (01 backpack)

/// Calculate the sum of the different k prime numbers that can be divided into n. // 01 backpack, and list the prime numbers # include
 
  
# Include
  
   
# Include
   
    
# Include
    
     
Using namespace std; int cot; int used [1500]; int prime [1500]; void sushu () // prime number table {memset (used, 0, sizeof (used); cot = 0; for (int I = 2; I <= 1120; I ++) {if (! Used [I]) {prime [cot ++] = I; for (int j = 2 * I; j <= 1120; j + = I) used [j] = 1 ;}}int main () {int n, k, I, j, p; int dp [1500] [20]; while (~ Scanf ("% d", & n, & k), n + k) {sushu (); memset (dp, 0, sizeof (dp )); /// 01 backpack dp [0] [0] = 1; for (I = 0; I
     
      
= 1; j --) {for (p = n; p> = prime [I]; p --) dp [p] [j] + = dp [p-prime [I] [J-1];} printf ("% d \ n ", dp [n] [k]);} return 0 ;}