洛谷P1832 题解

思想：先将1000以内的质数筛出来存在num中，然后对num数组中的质数用完全背包做一遍就可以了（因为每个质数都可以取无限次，所以是完全背包）。

线性筛板子

int primes[N],  cnt;    
bool f[N];         
void get_primes(int n){
    for (int i = 2; i <= n; i ++ ){
        if (!f[i]) primes[cnt ++ ] = i;
        for (int j = 0; primes[j] <= n / i; j ++ ){
            f[primes[j] * i] = true;
            if (i % primes[j] == 0) break;
        }
    }
}

最后，是没有注解的完整AC代码

（哦对了，这里插一句，一定要开long long否则就真见祖宗去了）

#include "algorithm"
#include "iostream"
#define ll long long
using namespace std;
int m;
ll f[100005], num[168]={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};
int main(){
    scanf("%d",&m);
    f[0]=1;
    for(ll i=0;i<168;i++){
        for(ll j=num[i];j<=m;j++){
            f[j]+=f[j-num[i]];
        }
    }
    printf("%lld\n",f[m]);
    return 0;
}