题库练习 Magic Gems
← 上一题 下一题 →

A12441 | Magic Gems

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Reziba has many magic gems. Each magic gem can be split into $M$ normal gems. The amount of space each magic (and normal) gem takes is $1$ unit. A normal gem cannot be split.

Reziba wants to choose a set of magic gems and split some of them, so the total space occupied by the resulting set of gems is $N$ units. If a magic gem is chosen and split, it takes $M$ units of space (since it is split into $M$ gems); if a magic gem is not split, it takes $1$ unit.

How many different configurations of the resulting set of gems can Reziba have, such that the total amount of space taken is $N$ units? Print the answer modulo $1000000007$ ( $10^9+7$ ). Two configurations are considered different if the number of magic gems Reziba takes to form them differs, or the indices of gems Reziba has to split differ.

输入格式

The input contains a single line consisting of $2$ integers $N$ and $M$ ( $1 \le N \le 10^{18}$ , $2 \le M \le 100$ ).

输出格式

Print one integer, the total number of configurations of the resulting set of gems, given that the total amount of space taken is $N$ units. Print the answer modulo $1000000007$ ( $10^9+7$ ).

输入输出样例

输入 #1
4 2
输出 #1
5
输入 #2
3 2
输出 #2
3
C++ 编辑器
输入
输出