素数分解 dp

8
9

3
4
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#define INF 100000000

using namespace std;
int a[300];
int b[300];
int dp[210][210];



int fun(){
	for(int i = 2 ;i <= 200;i++){
		int flag = 0;
		for(int j = 2;j < i ;j++){
			if(i%j == 0){
				a[i] = 0;
				flag = 1;
				break;
			}
		}
		if(!flag){
			a[i] = 1;
		}
	}
	
	int j = 0;
	for(int i = 0;i <= 200;i++){
		if(a[i]){
			b[j++] = i;
		}
	}
	b[j] = INF;
} 
int main(){
	fun();
	memset(dp,0,sizeof(dp));
	
	
	for(int i = 0;i <= 200;i++){
		dp[0][i] = 1 ;
		
	} 
	for(int i = 2;i <= 200;i++){
		for(int j = 0;b[j] <= 200;j++){
			if(b[j] > i){
				dp[i][j] = dp[i][j-1];
				continue;
			}
			if(j == 0){
				dp[i][j] = dp[i-b[j]][j];	
			}
			else{
				dp[i][j] = dp[i-b[j]][j] + dp[i][j-1];
			}
		}
	}
	int n;
	while(cin >> n){
		
		int i ;
		
		for(i = 0;b[i] <= n;i++){
		}
		i--;
		
		cout << dp[n][i] << endl;
	}
	return 0;
}