由于对于一个合法的答案,sqrt(500)后的素数最多只会用到一个,所以只对前8个素数状压后01背包。
dp(S, k)表示素数状态为S时由k个自然数组成的方法有几种。
再对后面的素数分别01背包。
代码:
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define CLR(A, X) memset(A, X, sizeof(A))
#define bitcount(X) __builtin_popcountll(X)
typedef long long LL;
typedef pair<int, int> PII;
const int N = 1<<8, M = 505;
const LL MOD = 1e9+7;
const double eps = 1e-10;
int dcmp(double x) { if(fabs(x) < eps) return 0; return x<0?-1:1; }
bool prime[M];
int num[N], state[M];
LL dp[N][M];
void init() {
num[0] = 1;
int k = 0;
for(int i = 2; i < M; i++) if(!prime[i]) {
if(k < 8) num[1<<k] = i, k++;
for(int j = i<<1; j < M; j += i) prime[j] = 1;
}
for(int i = 1; i < N; i++) {
int j = (i-1)&i;
num[i] = num[j]*num[i^j];
if(num[i] > M) num[i] = M;
}
}
int main() {
init();
int T;
scanf("%d", &T);
while(T--) {
int n, K;
scanf("%d%d", &n, &K);
CLR(dp, 0); dp[0][0] = 1;
for(int i = 0; i < N; i++) if(num[i] <= n) {
int ss = (N-1)^i;
for(int k = K; k >= 1; k--)
for(int j = ss; ; j = (j-1)&ss) {
(dp[i|j][k] += dp[j][k-1]) %= MOD;
if(j == 0) break;
}
}
for(int i = 23; i <= n; i++) if(!prime[i]) {
for(int k = K; k > 0; k--)
for(int j = 0; j < N; j++) if(num[j]*i <= n) {
int ss = (N-1)^j;
for(int s = ss; ; s = (s-1)&ss) {
(dp[j|s][k] += dp[s][k-1]) %= MOD;
if(s == 0) break;
}
}
}
LL ans = 0;
for(int i = 0; i < N; i++)
for(int k = K; k >= 1; k--)
(ans += dp[i][k]) %= MOD;
printf("%lld\n", ans);
}
return 0;
}