bzoj1025: [SCOI2009]游戏

#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
using namespace std;
#define rep(i,s,t) for(int i=s;i<=t;i++)
#define dwn(i,s,t) for(int i=s;i>=t;i--)
#define clr(x,c) memset(x,c,sizeof(x))
#define ll long long
int read(){
    int x=0;char c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) x=x*10+c-‘0‘,c=getchar();
    return x;
}
const int nmax=1005;
int prime[nmax],n,cnt;bool vis[nmax];
ll f[nmax],g[nmax];
void init(){
    cnt=0;
    rep(i,2,n) {
        if(!vis[i]) prime[++cnt]=i;
        rep(j,1,cnt){
            int tmp=prime[j];
            if(i*tmp>n) break;
            vis[i*tmp]=1;
            if(i%tmp==0) break;
        }
    }
    //rep(i,1,cnt) printf("%d ",prime[i]);printf("\n");
}
int main(){
    n=read();init();
    f[0]=g[0]=1;
    rep(i,1,cnt){
        rep(j,0,n){
            f[j]=g[j];int tmp=prime[i];
            for(int k=tmp;k<=j;k*=tmp) f[j]+=g[j-k];
        }
        rep(j,0,n) g[j]=f[j];
        //rep(j,1,n) printf("%d ",f[j]);printf("\n");
    }
    ll ans=0;
    rep(i,0,n) ans+=f[i];
    printf("%lld\n",ans);
    return 0;
}