洛谷P2563 [AHOI2001]质数和分解(线性筛+完全背包)

#include <iostream>
#include <cstring>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <cstdio>
#include <stdio.h>
#include<queue>
#include<math.h>
using namespace std;
const int MAX_N = 100000;
int v[MAX_N], prime[MAX_N];
int dp[2005];
int primes(int n)
{
	memset(v, 0, sizeof(v));//最小质因子
	int m = 0;//质数数量
	for (int i = 2; i <= n; i++)
	{
		if (v[i] == 0)
		{
			v[i] = i;
			prime[++m] = i;
		}
		for (int j = 1; j <= m; j++)
		{
			if (prime[j] > v[i] || prime[j] > n / i)break;
			v[i * prime[j]] = prime[j];
		}
	}
	return m;
}

int main()
{
	int m=primes(200);
	int n;
	while (cin >> n)
	{
		memset(dp, 0, sizeof(dp));
		dp[0] = 1;
		for (int i = 1; i <= m; i++)
		{
			for (int j = 2; j <= n; j++)
			{
				if (j >= prime[i])
				{
					dp[j] += dp[j - prime[i]];
				}
			}
		}
		printf("%d\n", dp[n]);
	}
}