题意:
思路1: 该题的状态转移方程还是挺好思考的,定义f[i][j]为解决前i-1位,第i为j的数列的方案种数。
那么可以得到状态转移方程,要爆int,所以注意要开longlong
f[i][j]] += f[i - 1][k] (k <= j || j % k != 0)
代码如下:
#include <iostream>
using namespace std;
const int N = 10010, MOD = 1000000007;
int n, m;
long long f[11][N];
int main()
{
cin >> n >> m;
for(int j = 1; j <= m; j ++ )
f[1][j] = 1;
for(int i = 2; i <= n; i ++ )
for(int j = 1; j <= m; j ++ )
for(int k = 1; k <= m; k ++ )
if(k <= j || k % j != 0)
{
f[i][j] += f[i - 1][k];
f[i][j] %= MOD;
}
long long res = 0;
for(int j = 1; j <= m; j ++ )
res += f[n][j], res %= MOD;
cout << res << endl;
return 0;
}
思路2:显然,该代码会tle,那我们思考思考怎么优化吧,可以第三个循环有优化的空间,我们可以将f[i - 1][j]的全部加起来到sum,然后计算f[i][j]时,用sum - 不满足条件的即可,不满足条件的枚举时,只需要枚举logm次。所以复杂度就降到了nmlogm,就可以顺利的过掉了
具体细节见代码:
#include <iostream>
using namespace std;
const int N = 10010, MOD = 1000000007;
int n, m;
long long f[11][N];
int main()
{
cin >> n >> m;
for(int j = 1; j <= m; j ++ )
f[1][j] = 1;
for(int i = 2; i <= n; i ++ )
{
long long sum = 0;
for(int j = 1; j <= m; j ++ ) //将 i - 1的全部累加起来,然后减去不满足条件的即可
sum = (sum + f[i - 1][j]) % MOD;
for(int j = 1; j <= m; j ++ )
{
long long usum = 0;
for(int k = 2 * j; k <= m; k += j)
usum = (usum + f[i - 1][k]) % MOD; //统计不满足条件的
f[i][j] = (sum - usum + MOD) % MOD;
}
}
long long res = 0;
for(int j = 1; j <= m; j ++ )
res += f[n][j], res %= MOD;
cout << res << endl;
return 0;
}