题意:一个序列a1, a2, ...., an,如果满足ai%ai-1 == 0 ( 2 <= i <= n ),那么就叫做好序列。现在给定n和k,其中1<=a1<=a2<=....<=an <= n,求长度为k的好序列的个数,答案对1e9+7取模。
题解:水DP,用dp[i][j]表示最后一项是i,长度为k的好序列的个数。
转移如下:
dp[i][j] = 1 ( 1 <= i <= n && j == 1)
dp[p][j+1] = sum(dp[i][j]) (其中p%i==0)
答案就是sum(dp[i][k]) ( 1 <= i <= n)
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod = 1e9+7;
ll dp[2005][2005];
int main(){
int n, k;
cin >> n >> k;
for(int i = 1; i <= n; ++i) dp[i][1] = 1;
for(int j = 1; j <= k; ++j){
for(int i = 1; i <= n; ++i){
if(dp[i][j] == 0) continue;
for(int l = 1; l*i <= n; ++l){
dp[i*l][j+1] += dp[i][j];
if(dp[i*l][j+1] >= mod) dp[i*l][j+1] -= mod;
}
}
}
ll sum = 0;
for(int i = 1; i <= n; ++i) {
sum += dp[i][k];
if(sum >= mod) sum -= mod;
}
cout << sum << '\n';
}