Hint:
Start from 1120 not to count same prime.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 |
#include <iostream> using namespace std; int dp[1121][15]; int main() { int n,k; int prme[189]={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, 1123, 1129}; for(int i=0;i<1121;i++) { for(int j=0;j<15;j++) { dp[i][j]=0; } } dp[0][0]=1; for(int i=0;i<187;i++) { for(int j=1120;j>=prme[i];j--) { for(int k=1;k<=14;k++) { dp[j][k]+=dp[j-prme[i]][k-1]; } } } /*for(int i=0;i<189;i++) for(int j=1120;j>=prme[i];j--) for(int k=1;k<15;k++) dp[j][k]+=dp[j-prme[i]][k-1]; */ while(cin>>n) { cin>>k; if(n==0 && k==0) break; cout<<dp[n][k]<<"\n"; } return 0; } |