只想到求和为n的数的lcm了...以为要求lcm然后离散化dp,最后发现1到1000的lcm已经炸了,然后就无奈了...
iwtwiioi神犇说的非常清晰【链接】
/* Footprints In The Blood Soaked Snow */
#include <cstdio>
#include <algorithm>
using namespace std;
typedef unsigned long long ULL;
const int maxn = 1005;
int n, prime[maxn], cnt;
bool isnotprime[maxn];
ULL dp[maxn][maxn];
inline void getprime() {
for(int i = 2; i <= n; i++) {
if(!isnotprime[i]) prime[++cnt] = i;
for(int j = 1; j <= cnt && i * prime[j] <= n; j++) {
isnotprime[i * prime[j]] = 1;
if(i % prime[j] == 0) break;
}
}
}
int main() {
scanf("%d", &n);
getprime();
dp[0][0] = 1;
for(int i = 1; i <= cnt; i++) for(int j = 0; j <= n; j++) {
dp[i][j] = dp[i - 1][j];
for(int k = prime[i]; j - k >= 0; k *= prime[i])
dp[i][j] += dp[i - 1][j - k];
}
ULL ans = 0;
for(int i = 0; i <= n; i++) ans += dp[cnt][i];
printf("%lld\n", ans);
return 0;
}