Mashmokh and ACM（dp）

题目链接： Mashmokh and ACM

---

大致题意:

给出正整数n和k，求满足最大数是n并且后一元素可以整除前一元素长度为k的序列个数

---

解题思路:

f[i][j]表示长度是i，当前位是j的序列个数

转移方程：f[i][j]=f[i][j]+f[i-1][k]（j可以整除k）

---

AC代码:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int N = 3000;
int n, k;
int f[N][N];
int main() {
	cin >> n >> k;
	memset(f, 0, sizeof f);
	for (int i = 1; i <= n; ++i)f[1][i] = 1;
	for (int i = 1; i <= k; ++i)
		for (int j = 1; j <= n; ++j)
			for (int k = j; k <= n; k += j)
				f[i][k] = (f[i][k] + f[i - 1][j]) % mod;
	int res = 0;
	for (int i = 1; i <= n; ++i)
		res = (res + f[k][i]) % mod;
	cout << res << endl;
	return 0;
}

END