codeforces-414B-Mashmokh and ACM

最新推荐文章于 2019-05-03 23:21:30 发布

宣之于口

最新推荐文章于 2019-05-03 23:21:30 发布

阅读量817

点赞数

分类专栏： codeforces ACM_动态规划文章标签： cf 414B

本文链接：https://blog.csdn.net/loy_184548/article/details/49637487

版权

这是一道来自codeforces的414B问题，要求找出在1到n的范围内，有多少个长度为k的序列，使得序列中的每个数字都能被其后一个数字整除。给定n和k，你需要计算符合条件的序列数量并模10^9+7。题目提供了样例输入和输出，以及基于动态规划的解题思路。

摘要由CSDN通过智能技术生成

codeforces-414B-Mashmokh and ACM

                    time limit per test1 second     memory limit per test256 megabytes

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 c