Mashmokh's boss, Bimokh, didn't like Mashmokh. So he fired him. Mashmokh decided to go to university and participate in ACM instead of finding a new job. He wants to become a member of Bamokh's team. In order to join he was given some programming tasks and one week to solve them. Mashmokh is not a very experienced programmer. Actually he is not a programmer at all. So he wasn't able to solve them. That's why he asked you to help him with these tasks. One of these tasks is the following.
A sequence of l integers b1, b2, ..., bl (1 ≤ b1 ≤ b2 ≤ ... ≤ bl ≤ n) is called good if each number divides (without a remainder) by the next number in the sequence. More formally for all i (1 ≤ i ≤ l - 1).
Given n and k find the number of good sequences of length k. As the answer can be rather large print it modulo 1000000007 (109 + 7).
The first line of input contains two space-separated integers n, k (1 ≤ n, k ≤ 2000).
Output a single integer — the number of good sequences of length k modulo 1000000007 (109 + 7).
3 2
5
6 4
39
2 1
2
In the first sample the good sequences are: [1, 1], [2, 2], [3, 3], [1, 2], [1, 3].
题意:用1-n范围内的数字构造一个长度为k的序列方案数,要求每一位都是前一位
的倍数.
用dp[i][j]表示i长度j结尾的方案数,那么dp[i][j]=sigma (dp[i-1][k]),其中j%k==0.
因为枚举的是k,所以总的复杂度是n^2lgn.
#include <cstring>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
#define maxn 2111
#define mod 1000000007
long long dp[maxn][maxn];//i长度 末尾是j
int n, k;
int main () {
//freopen ("in.txt", "r", stdin);
cin >> n >> k;
memset (dp, 0, sizeof dp);
for (int i = 1; i <= n; i++) {
dp[1][i] = 1;
}
for (int i = 1; i < k; i++) {
for (int j = 1; j <= n; j++) {
for (int p = j; p <= n; p += j) {
dp[i+1][p] += dp[i][j];
dp[i+1][p] %= mod;
}
}
}
long long ans = 0;
for (int i = 1; i <= n; i++) {
ans += dp[k][i];
ans %= mod;
}
cout << ans << "\n";
return 0;
}