【bzoj 1025】: [SCOI2009]游戏

http://www.lydsy.com/JudgeOnline/problem.php?id=1025

if(prim[i]>n) break;

又错在这里了

n>=997就会WA

还好有90分

//#define _TEST _TEST
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
/************************************************
Code By willinglive    Blog:http://willinglive.cf
************************************************/
#define rep(i,l,r) for(int i=(l),___t=(r);i<=___t;i++)
#define per(i,r,l) for(int i=(r),___t=(l);i>=___t;i--)
#define MS(arr,x) memset(arr,x,sizeof(arr))
#define LL unsigned long long
#define INE(i,u,e) for(int i=head[u];~i;i=e[i].next)
inline const int read()
{int r=0,k=1;char c=getchar();for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;
for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0';return k*r;}
/
const int N=1009;
int n;
LL prim[1010],cnt;
bool flag[1010];
LL dp[1010][1010];
/
void init_prim()
{
	rep(i,2,N)
	{
		if(!flag[i]) prim[++cnt]=i;
		for(int j=1;j<=cnt&&i*prim[j]<=N;j++)
		{
			flag[i*prim[j]]=1;
			if(i%prim[j]==0) break;
		}
	}
}
/
void input()
{
    cin>>n;
}
void solve()
{
	init_prim();
	rep(i,0,n) dp[0][i]=1;
	int tmp;
	rep(i,1,cnt)
	{
		tmp=i;
		if(prim[i]>n) break;
		rep(j,0,n)
		{
			dp[i][j]=dp[i-1][j];
			for(LL k=prim[i];k<=j;k*=prim[i])
			    if(j-k>=0) dp[i][j]+=dp[i-1][j-k];
		}
	}
	cout<<dp[tmp-1][n]<<endl;
}
/
int main()
{
    #ifndef _TEST
    freopen("std.in","r",stdin); freopen("std.out","w",stdout);
    #endif
    input(),solve();
    return 0;
}